{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:58:53Z","timestamp":1773655133775,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"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":[[1979,2]]},"DOI":"10.1016\/0022-0000(79)90055-2","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"92-107","source":"Crossref","is-referenced-by-count":20,"title":["Two decidability results for deterministic pushdown automata"],"prefix":"10.1016","volume":"18","author":[{"given":"Matti","family":"Linna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90055-2_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(76)90074-8","article-title":"The inclusion problem for simple languages","volume":"1","author":"Friedman","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(79)90055-2_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","article-title":"Strict deterministic grammars","volume":"7","author":"Harrison","year":"1973","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0022-0000(79)90055-2_BIB3","first-page":"89","article-title":"Two classes of CF-languages with a solvable equivalence problem","volume":"2","author":"Jaffe","year":"1974","journal-title":"Kibernetika (Kiev)"},{"key":"10.1016\/0022-0000(79)90055-2_BIB4","series-title":"IEEE Conf. Record of 7th Annual Syrup. on Switching and Automata Theory","first-page":"36","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966"},{"key":"10.1016\/0022-0000(79)90055-2_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0019-9958(76)90341-7","article-title":"Formal translations and Szilard languages","volume":"30","author":"Kriegel","year":"1976","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(79)90055-2_BIB6","series-title":"Left-fitting translations","author":"Kriegel","year":"1976"},{"key":"10.1016\/0022-0000(79)90055-2_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(73)90237-4","article-title":"The associate language and the derivation properties of formal grammars","volume":"22","author":"Moriya","year":"1973","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(79)90055-2_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00288639","article-title":"On derivation languages corresponding to context-free grammars","volume":"3","author":"Penttonen","year":"1974","journal-title":"Acta Informatica"},{"key":"10.1016\/0022-0000(79)90055-2_BIB9","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\/0022-0000(79)90055-2_BIB10","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\/0022-0000(79)90055-2_BIB11","series-title":"Decision Problems for Families of Deterministic Pushdown Automata","author":"Valiant","year":"1973"},{"key":"10.1016\/0022-0000(79)90055-2_BIB12","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\/0022-0000(79)90055-2_BIB13","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","article-title":"Deterministic one-counter automata","volume":"10","author":"Valiant","year":"1975","journal-title":"J. Comput. System. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:31Z","timestamp":1550319631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0022000079900552"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90055-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}