Sudborough, I. H. On the tape complexity of deterministic context-free languages. (English) Zbl 0379.68054 J. Assoc. Comput. Mach. 25, 405-414 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 49 Documents MSC: 68Q45 Formal languages and automata 68Q25 Analysis of algorithms and problem complexity 03D10 Turing machines and related notions PDF BibTeX XML Cite \textit{I. H. Sudborough}, J. Assoc. Comput. Mach. 25, 405--414 (1978; Zbl 0379.68054) Full Text: DOI OpenURL