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
top
How to cite
topChytil, Michal P.. "Crossing-bounded computations and their relation to the LBA-problem." Kybernetika 12.2 (1976): (76)-85. <http://eudml.org/doc/27793>.
@article{Chytil1976,
author = {Chytil, Michal P.},
journal = {Kybernetika},
language = {eng},
number = {2},
pages = {(76)-85},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Crossing-bounded computations and their relation to the LBA-problem},
url = {http://eudml.org/doc/27793},
volume = {12},
year = {1976},
}
TY - JOUR
AU - Chytil, Michal P.
TI - Crossing-bounded computations and their relation to the LBA-problem
JO - Kybernetika
PY - 1976
PB - Institute of Information Theory and Automation AS CR
VL - 12
IS - 2
SP - (76)
EP - 85
LA - eng
UR - http://eudml.org/doc/27793
ER -
References
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)
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.