Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Hartmanis:1983:GSS, author = "J. Hartmanis", title = "On Godel speed-up and succinctness of language representations", journal = j-THEOR-COMP-SCI, volume = "26", number = "3", pages = "335--342", month = oct, year = "1983", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal languages; Godel speed-up; language representations; nonrecursive shortening; succinctness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }