{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T05:32:19Z","timestamp":1680499939005},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2006,2,7]],"date-time":"2006-02-07T00:00:00Z","timestamp":1139270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2006,4,7]]},"DOI":"10.1007\/s00236-006-0005-0","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T12:58:02Z","timestamp":1139230682000},"page":"541-552","source":"Crossref","is-referenced-by-count":7,"title":["Deep pushdown automata"],"prefix":"10.1007","volume":"42","author":[{"given":"Alexander","family":"Meduna","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,7]]},"reference":[{"key":"5_CR1","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling, vol. 1. Parsing, Prentice Hall, Englewood Cliffs, New Jersey (1972)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A., (eds.) Handbook of Formal Languages, vol. 1. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01768471","volume":"11","author":"B. Courcelle","year":"1977","unstructured":"Courcelle, B.: On jump deterministic pushdown automata. Math. Systems Theory 11, 87\u2013109 (1977)","journal-title":"Math. Systems Theory"},{"key":"5_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. Akademie Verlag, Berlin (1989)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Greibach, S.A.: Checking automata and one-way stack languages. JCSS 3, 196\u2013217","DOI":"10.1016\/S0022-0000(69)80012-7"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. JACM 14, 389\u2013418 (1967)","journal-title":"JACM"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S. Ginsburg","year":"1968","unstructured":"Ginsburg, S., Spanier, E.: Finite-turn pushdown automata. SIAM J. Control 4, 429\u2013453 (1968)","journal-title":"SIAM J. Control"},{"key":"5_CR8","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts (1978)"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/S0022-0000(70)80045-9","volume":"4","author":"T. Kasai","year":"1970","unstructured":"Kasai, T.: An hierarchy between context-free and context-sensitive languages. Journal of Computer and System Sciences 4, 492\u2013508 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR10","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"5_CR11","volume-title":"Introduction to Languages and the Theory of Computation","author":"J.C. Martin","year":"1991","unstructured":"Martin, J.C.: Introduction to Languages and the Theory of Computation, McGraw-Hill, New York (1991)"},{"key":"5_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0501-5","volume-title":"Automata and Languages: Theory and Applications","author":"A. Meduna","year":"2000","unstructured":"Meduna, A.: Automata and Languages: Theory and Applications. Springer, London (2000)"},{"key":"5_CR13","first-page":"237","volume":"8","author":"A. Meduna","year":"1988","unstructured":"Meduna, A., Horwath, G.: On state grammars. Acta Cybernetica 8, 237\u2013245 (1988)","journal-title":"Acta Cybernetica"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Meduna, A.: Simultaneously one-turn two-pushdown automata. Inter. Computer Math. 679\u2013687 (2003)","DOI":"10.1080\/0020716031000070616"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Meduna, A., Kol\u00e1\u0159, D.: Regulated pushdown automata. Acta Cybernetica 653\u2013664 (2000)","DOI":"10.1007\/978-1-4471-0501-5_3"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0019-9958(73)90884-X","volume":"23","author":"E. Moriya","year":"1973","unstructured":"Moriya, E.: Some remarks on state grammars and matrix grammars. Information and Control 23, 48\u201357 (1973)","journal-title":"Information and Control"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.tcs.2004.12.029","volume":"337","author":"E. Moriya","year":"2005","unstructured":"Moriya, E., Hofbauer, D., Huber, M., Otto, F.: On state-alternating context-free grammars. Theoretical Computer Science 337, 183\u2013216 (2005)","journal-title":"Theoretical Computer Science"},{"key":"5_CR18","first-page":"15","volume":"421","author":"J. Sakarovitch","year":"1981","unstructured":"Sakarovitch, J.: Pushdown automata with terminating languages. Languages and Automata Symposium, RIMS 421, pp. 15\u201329, Kyoto University (1981)","journal-title":"Languages and Automata Symposium, RIMS"},{"key":"5_CR19","volume-title":"Languages and Machines","author":"T.A. Sudkamp","year":"1988","unstructured":"Sudkamp, T.A.: Languages and Machines. Addison Wesley, Reading, Massachusetts (1988)"},{"key":"5_CR20","first-page":"265","volume":"81","author":"L. Valiant","year":"1989","unstructured":"Valiant, L.: The equivalence problem for deterministic finite turn pushdown automata. Information and Control 81, 265\u2013279 (1989)","journal-title":"Information and Control"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0005-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-006-0005-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0005-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:53Z","timestamp":1558705313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-006-0005-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,7]]},"references-count":20,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2006,4,7]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s00236-006-0005-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2,7]]}}}