{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:19:38Z","timestamp":1760170778349},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108283"},{"type":"electronic","value":"9783540387169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10828-9_64","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:25:44Z","timestamp":1330190744000},"page":"211-223","source":"Crossref","is-referenced-by-count":3,"title":["On pushdown tree automata"],"prefix":"10.1007","author":[{"given":"Ir\u00e8ne","family":"Guessarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"14_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 (1968), 647\u2013671.","journal-title":"JACM"},{"key":"14_CR2","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 (1976), 5\u201328.","journal-title":"RAIRO Inf. Th\u00e9or."},{"key":"14_CR3","unstructured":"J. Bilstein, W. Damm, Top-down tree transducers for infinite trees, this Conference."},{"key":"14_CR4","unstructured":"G. Boudol, Langages alg\u00e9briques d'arbres, LITP Report, to appear."},{"key":"14_CR5","first-page":"87","volume":"11","author":"B. Courcelle","year":"1977","unstructured":"B. Courcelle, On jump deterministic pushdown automata, MST 11 (1977), 87\u2013109.","journal-title":"MST"},{"key":"14_CR6","unstructured":"W. Damm, The IO and OI hierarchies, Thesis, Report no41 (1980), RWTH Aachen."},{"key":"14_CR7","unstructured":"W. Damm, I. Guessarian, Combining T and n, submitted for publication."},{"key":"14_CR8","unstructured":"P. Downey, Formal languages and recursion schemes, Ph. D. Harvard (1974)."},{"key":"14_CR9","first-page":"198","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"J. Engelfriet, Bottom-up and top-down tree transformations. A comparison. MST 9 (1975), 198\u2013231.","journal-title":"MST"},{"key":"14_CR10","unstructured":"J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, Proc. Int. Symp. on For. Lang. Theor., Santa Barbara, Academic Press, to appear."},{"key":"14_CR11","first-page":"328","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"J. Engelfriet, E.M. Schmidt, IO and OI, JCSS 15 (1977), 328\u2013353, and JCSS 16 (1978), 67\u201399.","journal-title":"JCSS"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, Grammars with macro-like productions, 9th SWAT (1968), 131\u2013142.","DOI":"10.1109\/SWAT.1968.12"},{"key":"14_CR13","unstructured":"J.H. Gallier, Alternate proofs and new results about recursion schemes and DPDA's, Report MS-CIS-80-7, Dpt of Comp. Sc., Univ. of Pennsylvania (1980), to appear."},{"key":"14_CR14","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. no99, Springer-Verlag, Berlin (1981)."},{"key":"14_CR15","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"M. Nivat, On the interpretation of recursive polyadic program schemes, Symp. Mat. 15, Rome (1975), 255\u2013281.","journal-title":"Symp. Mat."},{"key":"14_CR16","unstructured":"N. Polian, Langages infinis engendr\u00e9s par les grammaires alg\u00e9briques d'arbres, Th. 3\u00e8me Cycle, in preparation, Poitiers (1981)."},{"key":"14_CR17","unstructured":"M. Rabin, Automata on infinite objects and Church's problem, CBSM regional Conf. series in Math. no13, AMS (1969)."},{"key":"14_CR18","first-page":"257","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"W.C. Rounds, Mappings and grammars on trees, MST 4 (1970), 257\u2013287.","journal-title":"MST"},{"key":"14_CR19","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":"14_CR20","volume-title":"Currents in Theory of Comp.","author":"J.W. Thatcher","year":"1973","unstructured":"J.W. Thatcher, Tree automata: an informal survey, in Currents in Theory of Comp., Aho (ed.), Prentice-Hall, London (1973)."}],"container-title":["Lecture Notes in Computer Science","CAAP '81"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10828-9_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:29Z","timestamp":1605643409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10828-9_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108283","9783540387169"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-10828-9_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}