{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:49:56Z","timestamp":1757544596228},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0304-3975(83)90006-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"313-322","source":"Crossref","is-referenced-by-count":3,"title":["On some decision questions concerning pushdown machines"],"prefix":"10.1016","volume":"24","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90006-3_BIB1","series-title":"The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(83)90006-3_BIB2","first-page":"315","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. CSS"},{"key":"10.1016\/0304-3975(83)90006-3_BIB3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(79)90080-2","article-title":"Some decidability results about regular and pushdown translations","volume":"8","author":"Culik","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(83)90006-3_BIB4","series-title":"Formal Language Theory, Perspectives and Open Problems","article-title":"Homomorphisms: decidability, equality and test sets","author":"Culik","year":"1980"},{"key":"10.1016\/0304-3975(83)90006-3_BIB5","series-title":"Classes of tranducers and their properties","author":"Culik","year":"1981"},{"key":"10.1016\/0304-3975(83)90006-3_BIB6","first-page":"79","article-title":"Superdeterministic DPDA's: The method of accepting does affect decision problems","volume":"19","author":"Friedman","year":"1979","journal-title":"J. CSS"},{"key":"10.1016\/0304-3975(83)90006-3_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite hierarchy of context-free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90006-3_BIB8","unstructured":"E.M. Gurari, Transducers with decidable equivalence problem, submitted for publication."},{"key":"10.1016\/0304-3975(83)90006-3_BIB9","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(83)90006-3_BIB10","first-page":"368","article-title":"What makes some language theory problems undecidable","volume":"4","author":"Hartmanis","year":"1970","journal-title":"J.CSS"},{"key":"10.1016\/0304-3975(83)90006-3_BIB11","author":"Head","year":"1979","journal-title":"Unique decipherability relative to a language"},{"key":"10.1016\/0304-3975(83)90006-3_BIB12","first-page":"87","article-title":"A-transducers and the monotonicity of IL schemes","volume":"21","author":"Head","year":"1980","journal-title":"J. CSS"},{"key":"10.1016\/0304-3975(83)90006-3_BIB13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(83)90006-3_BIB14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90006-3_BIB15","first-page":"36","author":"Korenjak","year":"1966","journal-title":"Simple deterministic languages"},{"key":"10.1016\/0304-3975(83)90006-3_BIB16","series-title":"Th\u00e8se 3\u00e8me cycle","article-title":"Transductions rationnelles d\u00e9croissantes et substitution","author":"Leguy-Cordellier","year":"1980"},{"key":"10.1016\/0304-3975(83)90006-3_BIB17","first-page":"92","article-title":"Two decidability results for deterministic pushdown automata","volume":"18","author":"Linna","year":"1979","journal-title":"J. CSS"},{"key":"10.1016\/0304-3975(83)90006-3_BIB18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0019-9958(78)90139-0","article-title":"The decidability of equivalence for deterministic stateless pushdown automata","volume":"38","author":"Oyamaguchi","year":"1978","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(83)90006-3_BIB19","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/S0019-9958(80)90887-6","article-title":"The equivalence problem for real-time strict deterministic languages","volume":"45","author":"Oyamaguchi","year":"1980","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(83)90006-3_BIB20","first-page":"366","article-title":"The equivalence problem for 2dpda's, one of which is a finite-turn or one-counter machine","volume":"23","author":"Oyamaguchi","year":"1981","journal-title":"J. CSS"},{"key":"10.1016\/0304-3975(83)90006-3_BIB21","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/0304-3975(83)90006-3_BIB22","series-title":"Ph.D. Thesis","article-title":"Decision procedures for families of deterministic pushdown automata","author":"Valiant","year":"1973"},{"key":"10.1016\/0304-3975(83)90006-3_BIB23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","article-title":"The equivalence problem for deterministic finite-turn pushdown automata","volume":"25","author":"Valiant","year":"1974","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(83)90006-3_BIB24","first-page":"340","article-title":"Deterministic one counter automata","volume":"10","author":"Valiant","year":"1975","journal-title":"J. CSS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900063?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900063?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:28:20Z","timestamp":1555126100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0304397583900063"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90006-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}