{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:09:52Z","timestamp":1709813392255},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"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":10882,"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,10]]},"DOI":"10.1016\/0304-3975(83)90016-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"335-342","source":"Crossref","is-referenced-by-count":25,"title":["On G\u00f6del speed-up and succinctness of language representations"],"prefix":"10.1016","volume":"26","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90016-6_BIB1","series-title":"Theories of Abstract Automata","author":"Arbib","year":"1969"},{"key":"10.1016\/0304-3975(83)90016-6_BIB2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machines","volume":"11","author":"Blum","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(83)90016-6_BIB3","series-title":"A Programming Logic","author":"Constable","year":"1978"},{"key":"10.1016\/0304-3975(83)90016-6_BIB4","first-page":"23","article-title":"\u00dcber die L\u00e4nge der Beweise","volume":"VII","author":"G\u00f6del","year":"1936","journal-title":"Ergebn. Eines Math. Kolloquiums"},{"key":"10.1016\/0304-3975(83)90016-6_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/197610R100291","article-title":"On effective speed-up and long proofs of trivial theorems in formal theories","author":"Hartmanis","year":"1976","journal-title":"R.A.I.R.O. Informatique Theoretique"},{"key":"10.1016\/0304-3975(83)90016-6_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/0209010","article-title":"On the succinctness of different representations of languages","volume":"9","author":"Hartmanis","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90016-6_BIB7","first-page":"392","article-title":"Succinctness, verifiability and determinism in representations of polynomial-time languages","author":"Hartmanis","year":"1979","journal-title":"20th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(83)90016-6_BIB8","series-title":"Proc. 8th Symp. in Mathematical Foundations of Computer Science","first-page":"70","article-title":"Relative succinctness of representations of language and separation of complexity classes","volume":"74","author":"Hartmanis","year":"1979"},{"key":"10.1016\/0304-3975(83)90016-6_BIB9","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0019-9958(72)90592-X","article-title":"Program size in restricted programming languages","volume":"21","author":"Meyer","year":"1972","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(83)90016-6_BIB10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/SWAT.1971.11","article-title":"Economy of description by automata, grammars and formal systems","author":"Meyer","year":"1971","journal-title":"Conf. Record IEEE 12th Ann. Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(83)90016-6_BIB11","series-title":"Natural Deduction","author":"Prawitz","year":"1965"},{"key":"10.1016\/0304-3975(83)90016-6_BIB12","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/0206039","article-title":"Succinctness of descriptions of unambiguous context-free language","volume":"6","author":"Schmidt","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90016-6_BIB13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","article-title":"A note on the succinctness of description of deterministic languages","volume":"32","author":"Valiant","year":"1976","journal-title":"Inform. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:28:45Z","timestamp":1555126125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0304397583900166"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90016-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}