Crossing-bounded computations and their relation to the LBA-problem
Kybernetika, Tome 12 (1976) no. 2, pp. 76-85 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 02F10, 03D10, 68A25, 68Q25, 68Q45
@article{KYB_1976_12_2_a1,
     author = {Chytil, Michal P.},
     title = {Crossing-bounded computations and their relation to the {LBA-problem}},
     journal = {Kybernetika},
     pages = {76--85},
     year = {1976},
     volume = {12},
     number = {2},
     mrnumber = {0408314},
     zbl = {0324.68050},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1976_12_2_a1/}
}
TY  - JOUR
AU  - Chytil, Michal P.
TI  - Crossing-bounded computations and their relation to the LBA-problem
JO  - Kybernetika
PY  - 1976
SP  - 76
EP  - 85
VL  - 12
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/KYB_1976_12_2_a1/
LA  - en
ID  - KYB_1976_12_2_a1
ER  - 
%0 Journal Article
%A Chytil, Michal P.
%T Crossing-bounded computations and their relation to the LBA-problem
%J Kybernetika
%D 1976
%P 76-85
%V 12
%N 2
%U http://geodesic.mathdoc.fr/item/KYB_1976_12_2_a1/
%G en
%F KYB_1976_12_2_a1
Chytil, Michal P. Crossing-bounded computations and their relation to the LBA-problem. Kybernetika, Tome 12 (1976) no. 2, pp. 76-85. http://geodesic.mathdoc.fr/item/KYB_1976_12_2_a1/

[1] J. E. Hopcroft J. D. Ullman: Formal languages and their relation to automata. Addison-Wesley, 1969. | MR

[2] M. S. Paterson: Tape bounds for time-bounded Turing machines. JCSS 6, (1972), 116-124. | MR | Zbl

[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

[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.