{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T08:27:03Z","timestamp":1745656023176},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095101"},{"type":"electronic","value":"9783540351689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09510-1_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:42:47Z","timestamp":1330188167000},"page":"282-288","source":"Crossref","is-referenced-by-count":9,"title":["On the succinctness of different representations of languages"],"prefix":"10.1007","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","volume":"11","author":"M. Blum","year":"1967","unstructured":"Blum, M. \"On the Size of Machines\", Information and Control, Vol. 11 (1967), 257\u2013265.","journal-title":"Information and Control"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Hartmanis, J. \"Context-Free Languages and Turing Machine Computations\", Proceedings of Symposia in Applied Mathematics, Vol. 19, Mathematical Aspects of Computer Science, pp. 42\u201351, Amer. Math. Soc. 1967.","DOI":"10.1090\/psapm\/019\/0235938"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Meyer, A.R. and M.J. Fischer. \"Economy of Description by Automata, Grammars and Formal Systems\", Conference Record, IEEE 12th Annual Symposium on Switching and Automata Theory (1971), 188\u2013190.","DOI":"10.1109\/SWAT.1971.11"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(75)90013-4","volume":"1","author":"H. Reedy","year":"1975","unstructured":"Reedy, H. and W.J. Savitch. \"The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages\", Theoretical Computer Science, Vol. 1 (1975), 77\u201391.","journal-title":"Theoretical Computer Science"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/0206039","volume":"6","author":"E. H. Schmidt","year":"1977","unstructured":"Schmidt, E.H. and T.G. Szymanski. \"Succinctness of Descriptions of Unambiguous Context-Free Languages\", SIAM J. Computing, Vol. 6 (1977), 547\u2013553.","journal-title":"SIAM J. Computing"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","volume":"32","author":"L. G. Valiant","year":"1976","unstructured":"Valiant, L.G. \"A Note on the Succinctness of Descriptions of Deterministic Languages\", Information and Control, Vol. 32 (1976), 139\u2013145.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09510-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:19Z","timestamp":1619557219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09510-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095101","9783540351689"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-09510-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}