Crossing-bounded computations and their relation to the LBA-problem
Kybernetika (1976)
- Volume: 12, Issue: 2, page (76)-85
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- J. E. Hopcroft J. D. Ullman, Formal languages and their relation to automata, Addison-Wesley, 1969. (1969) MR0237243
- M. S. Paterson, Tape bounds for time-bounded Turing machines, JCSS 6, (1972), 116-124. (1972) Zbl0236.02031MR0305667
- M. P. Chytil, Crossing-bounded automata and their relation to the LBA-problem, In Tagung liber Automatentheorie und Formale Sprachen, 1974, Universitat Dortmund. (1974)
- R. V. Freivalds, [unknown], oral communication. Zbl1163.68022
- J. Hartmanis H. B. Hunt III, The LBA Problem and its Importance in the Theory of Computing, TR 73-171, May 1973, Cornell University. (1973)