{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:36Z","timestamp":1771024236278,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1007\/bf01189852","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:46:49Z","timestamp":1108676809000},"page":"313-326","source":"Crossref","is-referenced-by-count":7,"title":["On reducing the number of stack symbols in a PDA"],"prefix":"10.1007","volume":"26","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":"CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J. Goldstine","year":"1990","unstructured":"J. Goldstine, C. M. R. Kintala, and D. Wotschke. On measuring nondeterminism in regular languages.Information and Computation, 86:179?194, 1990.","journal-title":"Information and Computation"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01786988","volume":"15","author":"J. Goldstine","year":"1982","unstructured":"J. Goldstine, J. K. Price, and D. Wotschke. On reducing the number of states in a pda.Mathematical Systems Theory, 15:315?321, 1982.","journal-title":"Mathematical Systems Theory"},{"key":"CR3","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?which is more economical?Theoretical Computer Science, 18:33?40, 1982.","journal-title":"Theoretical Computer Science"},{"key":"CR4","first-page":"91","volume":"14","author":"S. Greibach","year":"1966","unstructured":"S. Greibach. An infinite hierarchy of context-free languages.Journal of the ACM, 14:91?106, 1966.","journal-title":"Journal of the ACM"},{"key":"CR5","first-page":"282","volume-title":"Lecture Notes in Computer Science, vol. 71","author":"J. Hartmanis","year":"1979","unstructured":"J. Hartmanis.On the Succinctness of Different Representations of Languages. Lecture Notes in Computer Science, vol. 71. Springer-Verlag, Berlin, pp. 282?288, 1979."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(83)90016-6","volume":"26","author":"J. Hartmanis","year":"1983","unstructured":"J. Hartmanis. On G\u00f6del speed-up and succinctness of language representations.Theoretical Computer Science, 26:335?342, 1983.","journal-title":"Theoretical Computer Science"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C. M. R. Kintala","year":"1980","unstructured":"C. M. R. Kintala and D. Wotschke. Amount of nondeterminism in finite automata.Acta Informatica, 13:199?204, 1980.","journal-title":"Acta Informatica"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. R. Meyer and M. J. Fischer. Economy of description by automata, grammars, and formal systems.Proc. 12th Symposium on Switching and Automata Theory, pp. 188?191, 1981.","DOI":"10.1109\/SWAT.1971.11"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/0206039","volume":"6","author":"E. M. Schmidt","year":"1977","unstructured":"E. M. Schmidt and T. G. Szymanski. Succinctness of descriptions of unambiguous context-free languages.SIAM Journal on Computing, 6:547?553, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","volume":"11","author":"R. E. Stearns","year":"1967","unstructured":"R. E. Stearns. A regularity test for pushdown machines.Information and Control, 11:323?340, 1967.","journal-title":"Information and Control"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321864.321865","volume":"22","author":"L. G. Valiant","year":"1975","unstructured":"L. G. Valiant. Regularity and related problems for deterministic pushdown automata.Journal of the ACM, 22:1?10, 1975.","journal-title":"Journal of the ACM"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","volume":"32","author":"L. G. Valiant","year":"1976","unstructured":"L. G. Valiant. A note on the succinctness of descriptions of deterministic languages.Information and Control, 32:139?145, 1976.","journal-title":"Information and Control"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189852.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189852\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T11:35:46Z","timestamp":1734953746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01189852"],"URL":"https:\/\/doi.org\/10.1007\/bf01189852","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}