{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:38:49Z","timestamp":1703187529682},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1007\/bf01744582","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T08:56:39Z","timestamp":1118912199000},"page":"237-263","source":"Crossref","is-referenced-by-count":50,"title":["Pushdown tree automata"],"prefix":"10.1007","volume":"16","author":[{"given":"In\u00e8ne","family":"Guessarian","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01744582_CR1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A. V. Aho","year":"1968","unstructured":"A. V. Aho, Indexed grammars: An extension of the context-free case,JACM 15, 647\u2013671 (1968).","journal-title":"JACM"},{"key":"BF01744582_CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","volume":"16","author":"A. V. Aho","year":"1969","unstructured":"A. V. Aho, Nested stack automata,JACM 16, 383\u2013406 (1969).","journal-title":"JACM"},{"key":"BF01744582_CR3","first-page":"5","volume":"10","author":"A. Arnold","year":"1976","unstructured":"A. Arnold, M. Dauchet, Transductions de for\u00eats reconnaissables monadiques. For\u00eats cor\u00e9guli\u00e8res, RAIRO Inf. Th\u00e9or. 10, 5\u201328 (1976).","journal-title":"RAIRO Inf. Th\u00e9or."},{"key":"BF01744582_CR4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/S0019-9958(80)90698-1","volume":"46","author":"A. Arnold","year":"1980","unstructured":"A. Arnold, B. Leguy, Une propri\u00e9t\u00e9 des for\u00eats alg\u00e9briques de Greibach, Information & Control, Vol. 46, 108\u2013134 (1980).","journal-title":"Information & Control"},{"key":"BF01744582_CR5","first-page":"219","volume":"13","author":"A. Arnold","year":"1980","unstructured":"A. Arnold, M. Nivat, Formal computations of nondeterministic program schemes,MST 13, 219\u2013236 (1980).","journal-title":"MST"},{"key":"BF01744582_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel,Transductions and Context-Free Languages, Teubner, Stuttgart (1979)."},{"key":"BF01744582_CR7","unstructured":"G. Boudol, Langages alg\u00e9briques d'arbres, LITP report n\u00b0 81\u20132."},{"key":"BF01744582_CR8","first-page":"87","volume":"11","author":"B. Courcelle","year":"1977","unstructured":"B. Courcelle, On jump deterministic pushdown automata,MST 11, 87\u2013109 (1977).","journal-title":"MST"},{"key":"BF01744582_CR9","unstructured":"W. Damm, Personal communication."},{"key":"BF01744582_CR10","unstructured":"P. Downey, Formal languages and recursion schemes, Ph.D. Harvard (1974)."},{"key":"BF01744582_CR11","first-page":"198","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"J. Engelfriet, Bottom-up and top-down tree transformations. A comparison,MST 9, 198\u2013231 (1975).","journal-title":"MST"},{"key":"BF01744582_CR12","first-page":"241","volume-title":"Formal Languages: Perspectives and Open Problems","author":"J. Engelfriet","year":"1980","unstructured":"J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, inFormal Languages: Perspectives and Open Problems, Academic Press, London (1980), 241\u2013286."},{"key":"BF01744582_CR13","first-page":"328","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"J. Engelfriet, E. M. Schmidt, IO and OI,JCSS 15, 328\u2013353, (1977) andJCSS 16, 67\u201399 (1978).","journal-title":"JCSS"},{"key":"BF01744582_CR14","unstructured":"J. Engelfriet, G. Slutzki, Extended macrogrammars and stack controlled machines, Memo n\u00b0 379, T. H. Twente, (1982)."},{"key":"BF01744582_CR15","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, Grammars with macro-like productions, 9thSWAT, 131\u2013142 (1968).","DOI":"10.1109\/SWAT.1968.12"},{"key":"BF01744582_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(81)90055-4","volume":"14","author":"J. H. Gallier","year":"1981","unstructured":"J. H. Gallier, DPDA's in \u201cAtomic normal form\u201d and applications to equivalence problems,TCS 14, 155\u2013186 (1981).","journal-title":"TCS"},{"key":"BF01744582_CR17","unstructured":"S. Gorn, Explicit definitions and linguistic dominoes, in J. Hart, S. Takasu, Eds,Systems and Computer Science (1965)."},{"key":"BF01744582_CR18","series-title":"Lect. Notes in Comp. Sc.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10284-1","volume-title":"Algebraic semantics","author":"I. Guessarian","year":"1981","unstructured":"I. Guessarian,Algebraic semantics, Lect. Notes in Comp. Sc. n\u00b0 99, Springer-Verlag, Berlin (1981)."},{"key":"BF01744582_CR19","volume-title":"Introduction to Formal Languages Theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison,Introduction to Formal Languages Theory, Addison-Wesley, London, (1978)."},{"key":"BF01744582_CR20","first-page":"36","volume-title":"Simple deterministic languages, 7th Symp","author":"J. E. Hopcroft","year":"1966","unstructured":"J. E. Hopcroft, A. J. Korenjak, Simple deterministic languages, 7th Symp. Switching and Automata Theory, Berkeley, 36\u201346 (1966)."},{"key":"BF01744582_CR21","unstructured":"B. Leguy, R\u00e9ductions, transformations et classification des grammaires alg\u00e9briques d'arbres, Th\u00e8se 3\u00e8me Cycle, Univ. Lille 1 (1980)."},{"key":"BF01744582_CR22","unstructured":"M. Nivat, On the interpretation of recursive polyadic program schemes, Symp. Mat. 15, Rome, 255\u2013281 (1975)."},{"key":"BF01744582_CR23","unstructured":"N. Polian, Adh\u00e9rences et centres de langages d'arbres, Th\u00e8se de 3\u00e8me cycle, Poitiers (1981)."},{"key":"BF01744582_CR24","unstructured":"M. Rabin, Automata on infinite objects and Church's problem, CBSM regional Conf. series in Math. n\u00b0 13, AMS (1969)."},{"key":"BF01744582_CR25","first-page":"257","volume":"4","author":"W. C. Rounds","year":"1970","unstructured":"W. C. Rounds, Mappings and grammars on trees,MST 4, 257\u2013287 (1970).","journal-title":"MST"},{"key":"BF01744582_CR26","doi-asserted-by":"crossref","unstructured":"W. C. Rounds, Tree oriented proofs of some theorems on context-free and indexed languages, 2nd Symposium on Theory of Computing, 109\u2013116 (1970).","DOI":"10.1145\/800161.805156"},{"key":"BF01744582_CR27","unstructured":"A. Saoudi, For\u00eats infinitaires reconnaissables, Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 Paris 7 (1982)."},{"key":"BF01744582_CR28","unstructured":"K. Schimpf, A parsing method for context-free tree languages, Ph.D. University of Pennsylvania (1982)."},{"key":"BF01744582_CR29","unstructured":"K. Schimpf, J. Gallier, Parsing tree languages using bottom-up tree automata with tree pushdown stores, Extended abstract, University of Pennsylvania (1981), to appear."},{"key":"BF01744582_CR30","unstructured":"J. M. Steyaert, Lemmes d'it\u00e9ration pour les familles d'arbres, Actes du S\u00e9minaire d'Inf. Th\u00e9or. 1977\u20131978, LITP Report, Paris (1979)."},{"key":"BF01744582_CR31","volume-title":"Currents in Theory of Comp.","author":"J. W. Thatcher","year":"1973","unstructured":"J. W. Thatcher, Tree automata: An informal survey, inCurrents in Theory of Comp., Aho (ed.), Prentice-Hall, London (1973)."},{"key":"BF01744582_CR32","first-page":"57","volume":"2","author":"J. W. Thatcher","year":"1968","unstructured":"J. W. Thatcher, J. B. Wright, Generalized finite automata theory with an application to a decision problem of second order logic,MST 2, 57\u201381 (1968).","journal-title":"MST"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744582.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01744582\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:25:31Z","timestamp":1586287531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01744582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["BF01744582"],"URL":"https:\/\/doi.org\/10.1007\/bf01744582","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}