{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:10:59Z","timestamp":1649189459669},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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]]},"DOI":"10.1016\/0304-3975(83)90138-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"57-69","source":"Crossref","is-referenced-by-count":1,"title":["Constructing a realtime deterministic pushdown automaton from a grammar"],"prefix":"10.1016","volume":"22","author":[{"given":"Jan","family":"Pittl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amiram","family":"Yehudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90138-X_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\/0304-3975(83)90138-X_BIB2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","article-title":"A new normal-form theorem for context-free phrase structure grammars","volume":"12","author":"Greibach","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90138-X_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(77)90033-0","article-title":"Economy of description by parsers, DPDAs and PDAs","volume":"4","author":"Geller","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90138-X_BIB4","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(83)90138-X_BIB5","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(83)90138-X_BIB6","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\/0304-3975(83)90138-X_BIB7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0022-0000(79)90055-2","article-title":"Two decidability results for deterministic pushdown automata","volume":"18","author":"Linna","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90138-X_BIB8","article-title":"Context free grammars: covers, normal forms and parsing","volume":"93","author":"Nijholt","year":"1980"},{"key":"10.1016\/0304-3975(83)90138-X_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":"Information and Control"},{"key":"10.1016\/0304-3975(83)90138-X_BIB10","series-title":"Mathematical Foundations of Computer Science 1978","first-page":"426","article-title":"On two subclasses of realtime grammars","volume":"64","author":"Pittl","year":"1978"},{"issue":"3","key":"10.1016\/0304-3975(83)90138-X_BIB11","first-page":"209","article-title":"Characterizations of stack uniform strict deterministic languages","volume":"17","author":"Pittl","year":"1981","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(83)90138-X_BIB12","series-title":"Ph.D. Thesis","article-title":"On the complexity of grammar and language problems","author":"Yehudai","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758390138X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758390138X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:55:13Z","timestamp":1555077313000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758390138X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["030439758390138X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90138-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}