{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:34Z","timestamp":1771024234888,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01786988","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T13:17:33Z","timestamp":1119187053000},"page":"315-321","source":"Crossref","is-referenced-by-count":7,"title":["On reducing the number of states in a PDA"],"prefix":"10.1007","volume":"15","author":[{"given":"Jonathan","family":"Goldstine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John K.","family":"Price","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Wotschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01786988_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing","author":"A. V. Aho","year":"1972","unstructured":"A. V. Aho and J. D. Ullman.The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing. Prentice-Hall: Englewood Cliffs, 1972."},{"key":"BF01786988_CR2","first-page":"116","volume-title":"Language and Information","author":"Y. Bar-Hillel","year":"1964","unstructured":"Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars, in Y. Bar-Hillel,Language and Information. Reading: Addison-Wesley, 116\u2013150, 1964."},{"key":"BF01786988_CR3","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg.The Mathematical Theory of Context-Free Languages. New York: McGraw-Hill, 1966."},{"key":"BF01786988_CR4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0019-9958(66)80016-5","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and S. A. Greibach. Deterministic context-free languages,Information and Control 9, 563\u2013582, 1966.","journal-title":"Information and Control"},{"key":"BF01786988_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(82)90110-4","volume":"18","author":"J. Goldstine","year":"1982","unstructured":"J. Goldstine, J. K. Price, and D. Wotschke. A pushdown automaton or a context-free grammar\u2014which is more economical?,Theoretical Computer Science 18, 33\u201340, 1982.","journal-title":"Theoretical Computer Science"},{"key":"BF01786988_CR6","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/S0019-9958(71)90519-5","volume":"18","author":"J. Gruska","year":"1971","unstructured":"J. Gruska. Complexity and unambiguity of context-free grammars and languages,Information and Control 18, 502\u2013519, 1971.","journal-title":"Information and Control"},{"key":"BF01786988_CR7","volume-title":"Introduction to Formal Language Theory","author":"M. A. Harrison","year":"1978","unstructured":"M. A. Harrison.Introduction to Formal Language Theory. Reading: Addison-Wesley, 1978."},{"key":"BF01786988_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. D. Ullman.Introduction to Automata Theory, Languages, and Computation. Reading: Addison-Wesley, 1979."},{"key":"BF01786988_CR9","first-page":"63","volume-title":"Sequential Machines: Selected Papers","author":"M. O. Rabin","year":"1964","unstructured":"M. O. Rabin and D. Scott. Finite automata and their decision problems, in E. F. Moore (ed.).Sequential Machines: Selected Papers. Reading: Addison-Wesley, 63\u201391, 1964."},{"key":"BF01786988_CR10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","volume":"6","author":"M. P. Schutzenberger","year":"1963","unstructured":"M. P. Schutzenberger. On context-free languages and push-down automata,Information and Control 6, 246\u2013264, 1963.","journal-title":"Information and Control"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01786988.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01786988\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01786988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T09:12:11Z","timestamp":1557479531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01786988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01786988"],"URL":"https:\/\/doi.org\/10.1007\/bf01786988","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}