{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:31:24Z","timestamp":1768264284965,"version":"3.49.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10393,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,2]]},"DOI":"10.1016\/0022-0000(85)90002-9","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"25-40","source":"Crossref","is-referenced-by-count":21,"title":["Tree pushdown automata"],"prefix":"10.1016","volume":"30","author":[{"given":"Karl M.","family":"Schimpf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean H.","family":"Gallier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0022-0000(85)90002-9_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/321526.321529","article-title":"Nested stack automata","volume":"16","author":"Aho","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90002-9_BIB2","article-title":"The theory of parsing, translation, and compiling","volume":"3","author":"Aho","year":"1972","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0022-0000(85)90002-9_BIB3","article-title":"Mathematical theory of automata, Notes on material presented by Buchi and Wright","author":"Buchi","year":"1960"},{"key":"10.1016\/0022-0000(85)90002-9_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(59)90362-6","article-title":"On certain formal properties of grammars","volume":"2","author":"Chomsky","year":"1959","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90002-9_BIB5","article-title":"Context-free Grammars and Pushdown Storage","author":"Chomsky","year":"1962","journal-title":"MIT Research Lab of Electronics Quarterly Progress Report No. 65"},{"issue":"No. 2","key":"10.1016\/0022-0000(85)90002-9_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(76)80036-0","article-title":"Completeness results for equivalence of recursive schemes","volume":"12","author":"Courcelle","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90002-9_BIB7","article-title":"A representation of trees by languages, I, II","volume":"6, 7","author":"Courcelle","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90002-9_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(70)80041-1","article-title":"Tree acceptors and some of their applications","volume":"4","author":"Doner","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90002-9_BIB9","article-title":"Formal Languages and Recursion Schemes","author":"Downey","year":"1974"},{"key":"10.1016\/0022-0000(85)90002-9_BIB10","article-title":"Some open questions and recent results on tree transducers and tree languages","author":"Engelfriet","year":"1980"},{"key":"10.1016\/0022-0000(85)90002-9_BIB11","series-title":"Formal Language Theory","article-title":"Some open questions and recent results in tree transducers and tree languages","author":"Engelfriet","year":"1980"},{"key":"10.1016\/0022-0000(85)90002-9_BIB12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and IO I, II","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90002-9_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1968.12","article-title":"Grammars with Macro-like Productions","author":"Fischer","year":"1968"},{"key":"10.1016\/0022-0000(85)90002-9_BIB14","series-title":"9th Sympos., Switching and Automata Theory","article-title":"Grammars with macro-like productions","author":"Fischer","year":"1969"},{"key":"10.1016\/0022-0000(85)90002-9_BIB15","series-title":"Syntactic Methods in Pattern Recognition","author":"Fu","year":"1974"},{"key":"10.1016\/0022-0000(85)90002-9_BIB16","article-title":"Tree systems for syntactic pattern recognition","volume":"C22","author":"Fu","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(85)90002-9_BIB17","article-title":"Alternative Proofs and New Results about Recursion Schemes and DPDA's","author":"Gallier","year":"1980"},{"issue":"2","key":"10.1016\/0022-0000(85)90002-9_BIB18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(81)90055-4","article-title":"DPDA's in \u201catomic normal form\u201d and applications to equivalence problems","volume":"14","author":"Gallier","year":"1981","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0022-0000(85)90002-9_BIB19","series-title":"Proceedings of the Symposium on Mathematical Theory of Automata","article-title":"Processors for infinite codes of the Shannon-Fano type","author":"Gorn","year":"1962"},{"key":"10.1016\/0022-0000(85)90002-9_BIB20","series-title":"Explicit Definitions and Linguistic Dominoes, Systems and Computer Science","author":"Gorn","year":"1965"},{"key":"10.1016\/0022-0000(85)90002-9_BIB21","series-title":"Proceedings of 6th CAAP, Genoa","article-title":"On pushdown tree automata","author":"Guessarian","year":"1981"},{"key":"10.1016\/0022-0000(85)90002-9_BIB22","article-title":"Pushdown Tree Automaton","author":"Guessarian","year":"1982"},{"key":"10.1016\/0022-0000(85)90002-9_BIB23","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(85)90002-9_BIB24","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the translation of languages from left to right","volume":"8","author":"Knuth","year":"1965","journal-title":"Inform. and Control"},{"issue":"No. 1","key":"10.1016\/0022-0000(85)90002-9_BIB25","article-title":"Parsing macro grammars top down","volume":"40","author":"Mehlhorn","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90002-9_BIB26","article-title":"On the interpretation of recursic polyadic program schemes","volume":"Vol. 15","author":"Nivat","year":"1975"},{"key":"10.1016\/0022-0000(85)90002-9_BIB27","series-title":"IEEE 10th Annual Symposium on Switching and Automata Theory","article-title":"Context-free grammars on trees","author":"Rounds","year":"1969"},{"issue":"No. 3","key":"10.1016\/0022-0000(85)90002-9_BIB28","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"J. Math. System Theory"},{"key":"10.1016\/0022-0000(85)90002-9_BIB29","article-title":"A Parsing Method for Context-free Tree Languages","author":"Schimpf","year":"1982"},{"key":"10.1016\/0022-0000(85)90002-9_BIB30","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context-free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90002-9_BIB31","series-title":"Currents in the Theory of Computing","article-title":"Tree automata: an informal survey","author":"Thatcher","year":"1973"},{"key":"10.1016\/0022-0000(85)90002-9_BIB32","article-title":"Generalized finite automata theory with an application to a decision problem of second order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"J. Math. Systems Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:52:10Z","timestamp":1550307130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0022000085900029"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90002-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}