About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Chytil, Michal P.
Crossing-bounded computations and their relation to the LBA-problem. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (76)-85
MSC: 02F10, 03D10, 68A25, 68Q25, 68Q45 | MR 0408314 | Zbl 0324.68050
References:
[1] J. E. Hopcroft J. D. Ullman: Formal languages and their relation to automata. Addison-Wesley, 1969. MR 0237243
[2] M. S. Paterson: Tape bounds for time-bounded Turing machines. JCSS 6, (1972), 116-124. MR 0305667 | Zbl 0236.02031
[3] M. P. Chytil: Crossing-bounded automata and their relation to the LBA-problem. In Tagung liber Automatentheorie und Formale Sprachen, 1974, Universitat Dortmund.
[4] R. V. Freivalds: oral communication. Zbl 1163.68022
[5] J. Hartmanis H. B. Hunt III: The LBA Problem and its Importance in the Theory of Computing. TR 73-171, May 1973, Cornell University.
Partner of
EuDML logo