{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:02:24Z","timestamp":1648508544283},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90039-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"317-335","source":"Crossref","is-referenced-by-count":2,"title":["Some results on subclass containment problems for special classes of DPDA'S related to nonsingular machines"],"prefix":"10.1016","volume":"31","author":[{"given":"Michio","family":"Oyamaguchi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90039-2_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01768471","article-title":"On jump-deterministic pushdown automata","volume":"11","author":"Courcelle","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(84)90039-2_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(78)90022-1","article-title":"A note on nonsingular deterministic pushdown automata","volume":"7","author":"Friedman","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90039-2_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0020-0190(78)90019-4","article-title":"On equivalence and subclass containment problems for deterministic context-free languages","volume":"7","author":"Friedman","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(84)90039-2_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(79)90015-1","article-title":"Superdeterministic DPDAs: The method of accepting does affect decision problems","volume":"19","author":"Friedman","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90039-2_BIB5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0019-9958(79)90134-7","article-title":"Linearity is polynomially decidable for realtime pushdown store automata","volume":"42","author":"Greibach","year":"1979","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(84)90039-2_BIB6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/0201024","article-title":"Real-time strict deterministic languages","volume":"1","author":"Harrison","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90039-2_BIB7","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(84)90039-2_BIB8","first-page":"36","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966","journal-title":"IEEE 7th Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(84)90039-2_BIB9","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(84)90039-2_BIB10","first-page":"53","article-title":"On the equivalence problem for two dpda's, one of which is real-time","volume":"80","author":"Oyamaguchi","year":"1980"},{"key":"10.1016\/0304-3975(84)90039-2_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(80)90256-9","article-title":"A real-time strictness test for deterministic pushdown automata","volume":"47","author":"Oyamaguchi","year":"1980","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(84)90039-2_BIB12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/S0019-9958(80)90263-6","article-title":"A simplicity test for deterministic pushdown automata","volume":"47","author":"Oyamaguchi","year":"1980","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(84)90039-2_BIB13","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/0022-0000(81)90072-6","article-title":"The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine","volume":"23","author":"Oyamaguchi","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90039-2_BIB14","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","article-title":"Properties of deterministic topdown grammars","volume":"17","author":"Rosenkrantz","year":"1970","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(84)90039-2_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","article-title":"A regularity test for pushdown machines","volume":"11","author":"Stearns","year":"1967","journal-title":"Inform. Contr."},{"key":"10.1016\/0304-3975(84)90039-2_BIB16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/S0022-0000(76)80049-9","article-title":"A result on the equivalence problem for deterministic pushdown automata","volume":"13","author":"Taniguchi","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90039-2_BIB17","first-page":"759","article-title":"A branching algorithm for deciding equivalence of deterministic pushdown automata (in D0:R0)","volume":"J61-D","author":"Tomita","year":"1978","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0304-3975(84)90039-2_BIB18","series-title":"Ph.D. Thesis","article-title":"Decision procedures for families of deterministic pushdown automata","author":"Valiant","year":"1973"},{"key":"10.1016\/0304-3975(84)90039-2_BIB19","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(84)90039-2_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321864.321865","article-title":"Regularity and related problems for deterministic pushdown automata","volume":"22","author":"Valiant","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(84)90039-2_BIB21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(81)90105-8","article-title":"The simultaneous accessibility of two configurations of two equivalent dpda's","volume":"12","author":"Courcelle","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(84)90039-2_BIB22","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(82)80029-6","article-title":"A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata","volume":"52","author":"Tomita","year":"1982","journal-title":"Inform. Contr."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900392?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:51:09Z","timestamp":1555127469000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584900392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584900392"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90039-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}