{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:32Z","timestamp":1725456752275},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029624","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"313-321","source":"Crossref","is-referenced-by-count":0,"title":["Tree-stack automata"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Golubski","sequence":"first","affiliation":[]},{"given":"Wolfram-M.","family":"Lippe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","volume":"16","author":"A.V. Aho","year":"1969","unstructured":"Aho, A.V., (1969), Nested Stack Automata, J. Assoc. Comput. Mach. 16, pp. 383\u2013406","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(75)80004-3","volume":"10","author":"C. Beeri","year":"1975","unstructured":"Beeri, C., (1975), Two-Way Nested Stack Automata Are Equivalent to Two-Way Stack Automata, J. Comput. System Sci. 10, pp. 317\u2013339","journal-title":"J. Comput. System Sci."},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W.S. Brainerd","year":"1969","unstructured":"Brainerd, W.S., (1969), Tree Generating Regular Systems, Inform. and Control 14, pp. 217\u2013231","journal-title":"Inform. and Control"},{"key":"33_CR4","first-page":"91","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R., (1960), Regular canonical systems, Archiv f\u00fcr Mathematische Logik und Grundlagenforschung 6, pp. 91\u2013111","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/322169.322178","volume":"27","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J., Meineche Schmidt, E., van Leeuwen, J., (1980), Stack Machines and Classes of Nonnested Macro Languages J. Assoc. Comput. Mach. 27, pp. 96\u2013117","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J.,Rozenberg, G., Slutzki, G., (1980), Tree Transducer, L Systems, and Two-Way Machines, J. Comput. System Sci. 20, pp. 150\u2013202","journal-title":"J. Comput. System Sci."},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321371.321385","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A.,Harrison, M.A., (1967), Stack Automata and Compiling, J. Assoc. Comput. Mach. 14, pp. 172\u2013201","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR8","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., (1967), One-Way Stack Automata, J. Assoc. Comput. Mach. 14, pp. 389\u2013418","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR9","unstructured":"Golubski, W., Lippe, W.-M., (1990), Automaten mit Baumspeicher, to appear"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","volume":"3","author":"S.A. Greibach","year":"1969","unstructured":"Greibach, S.A., (1969), Checking Automata and One-Way Stack Languages, J. Comput. System Sci. 3, pp. 196\u2013217","journal-title":"J. Comput. System Sci."},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I., (1983), Pushdown Tree Automata, Math. Syst. Theory 16, pp. 237\u2013263","journal-title":"Math. Syst. Theory"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/321637.321639","volume":"18","author":"M.A. Harrison","year":"1971","unstructured":"Harrison, M.A., Schkolnick, M., (1971), A Grammatical Characterization of One-Way Nondeterministic Stack Languages, J. Assoc. Comput. Mach. 18, pp. 148\u2013172","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR13","unstructured":"Hopcroft, J.E., Ullman, J.D., (1979), Introduction to automata theory, languages and computation, Addison-Wesley Publishing Company"},{"key":"33_CR14","first-page":"110","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H., (1973), On correct Procedure Parameter Transmission in Higher Programming Languages, Acta Informatica 2, pp. 110\u2013142","journal-title":"Acta Informatica"},{"key":"33_CR15","first-page":"331","volume":"2+3","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H., (1973,1974), On Procedures as Open Subroutines I+II, Acta Informatica 2+3, pp. 331\u2013333, pp. 227\u2013241","journal-title":"Acta Informatica"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Lippe, W.-M., (1976), \u00dcber die Entscheidbarkeit der formalen Erreichbarkeit von Prozeduren bei monadischen Programmen, 4. Fachtagung \u00fcber Programmiersprachen, Informatik-Fachberichte 1, Springer-Verlag, pp.124\u2013134","DOI":"10.1007\/978-3-642-66319-2_12"},{"key":"33_CR17","first-page":"21","volume":"16","author":"W.-M. Lippe","year":"1980","unstructured":"Lippe, W.-M., (1980), Erweiterungen von Dendrogrammatiken, J. Inform. Process. Cybern. 16, pp. 21\u201339","journal-title":"J. Inform. Process. Cybern."},{"key":"33_CR18","unstructured":"Lippe, W.-M., (1983), Top-Down-Baumerzeugende Systeme und Automaten, Habilitation Thesis, University Kiel"},{"key":"33_CR19","unstructured":"Odgen, W.F., (1969), Intercalation Theorems For Stack Languages, Conf. Rec. of ACM Symposium on Theory of Computing, Marina del Rey, California, pp. 31\u201342"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:25Z","timestamp":1586578525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0029624","relation":{},"subject":[]}}