{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:06:13Z","timestamp":1767927973955,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":9787,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1016\/s0019-9958(86)80016-x","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"1-32","source":"Crossref","is-referenced-by-count":48,"title":["An automata-theoretical characterization of the OI-hierarchy"],"prefix":"10.1016","volume":"71","author":[{"given":"Werner","family":"Damm","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Goerdt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(86)80016-X_bib1","doi-asserted-by":"crossref","first-page":"383","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\/S0019-9958(86)80016-X_bib2","series-title":"Proc. 6th Colloq. on Trees in Algebra and Programming","first-page":"117","article-title":"Top-down tree transducers for infinite trees I","volume":"vol. 112","author":"Bilstein","year":"1981"},{"key":"10.1016\/S0019-9958(86)80016-X_bib3_1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(78)90008-7","article-title":"A representation of trees by languages","volume":"6","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80016-X_bib3_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","article-title":"A representation of trees by languages","volume":"7","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80016-X_bib4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","article-title":"The IO- and OI-hierarchies","volume":"20","author":"Damm","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80016-X_bib5","article-title":"Implementation techniques for recursive tree transducers on higher order data types","author":"Damm","year":"1983"},{"key":"10.1016\/S0019-9958(86)80016-X_bib6","series-title":"Recursive automata","author":"Engelfriet","year":"1982"},{"key":"10.1016\/S0019-9958(86)80016-X_bib7","series-title":"Proc. 15th Annu. ACM Sympos. Theory Comput","first-page":"365","article-title":"Iterated pushdown automata and complexity classes","author":"Engelfriet","year":"1983"},{"key":"10.1016\/S0019-9958(86)80016-X_bib8_1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(86)80016-X_bib8_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","article-title":"IO and OI","volume":"16","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(86)80016-X_bib9","series-title":"Proc. 9th IEEE Conference on Switching and Automata Theory","first-page":"131","article-title":"Grammars with macro like productions","author":"Fischer","year":"1968"},{"key":"10.1016\/S0019-9958(86)80016-X_bib10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(81)90055-4","article-title":"DPDA's in \u201catomic normalform\u201d and applicaions to equivalence problems","volume":"14","author":"Gallier","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80016-X_bib11","series-title":"Eine automatentheoretische Charakterisierung der OI-Hierarchie","author":"Goerdt","year":"1982"},{"key":"10.1016\/S0019-9958(86)80016-X_bib12","series-title":"A note on copying in iterated pushdown automata","author":"Goerdt","year":"1986"},{"key":"10.1016\/S0019-9958(86)80016-X_bib13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFL's and nested iterated substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(86)80016-X_bib14","article-title":"Zur Charakterisierung von Programmen mit endlichen Arten","author":"Klein","year":"1980"},{"key":"10.1016\/S0019-9958(86)80016-X_bib15","first-page":"237","article-title":"S\u00e9mantique alg\u00e9brique d'un language de programation type ALGOL","volume":"11","author":"Kott","year":"1977","journal-title":"Rev. Fran\u00e7aise Automat. Inform. Rech. Op\u00e9r."},{"key":"10.1016\/S0019-9958(86)80016-X_bib16","first-page":"55","article-title":"Multilevel stack automata","volume":"12","author":"Maslov","year":"1976","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S0019-9958(86)80016-X_bib17","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0019-9958(80)90867-0","article-title":"On the deterministic indexed languages","volume":"45","author":"Parchmann","year":"1980","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(86)80016-X_bib18","series-title":"Proc. 1st Internat. Sympos. Cat. Theory Appl. Inform. and Control","first-page":"209","article-title":"An algebraic formulation of the Chomsky-hieararchy","volume":"vol. 25","author":"Wand","year":"1975"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588680016X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588680016X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:24Z","timestamp":1548525264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001999588680016X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["S001999588680016X"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80016-x","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}