On optimum time bounds for recognition of some sets of words by on-line Turing machines
Kybernetika, Tome 05 (1969) no. 4, p. 279.

Voir la notice de l'article dans Czech Digital Mathematics Library

Classification : 68A25 
@article{KYB_1969__5_4_a1,
     author = {Strnad, Pavel},
     title = {On optimum time bounds for recognition of some sets of words by on-line {Turing} machines},
     journal = {Kybernetika},
     pages = {--279},
     publisher = {mathdoc},
     volume = {05},
     number = {4},
     year = {1969},
     mrnumber = {0323158},
     zbl = {0184.02303},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/KYB_1969__5_4_a1/}
}
TY  - JOUR
AU  - Strnad, Pavel
TI  - On optimum time bounds for recognition of some sets of words by on-line Turing machines
JO  - Kybernetika
PY  - 1969
SP  - 
EP  - 279
VL  - 05
IS  - 4
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/KYB_1969__5_4_a1/
LA  - en
ID  - KYB_1969__5_4_a1
ER  - 
%0 Journal Article
%A Strnad, Pavel
%T On optimum time bounds for recognition of some sets of words by on-line Turing machines
%J Kybernetika
%D 1969
%P -279
%V 05
%N 4
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/KYB_1969__5_4_a1/
%G en
%F KYB_1969__5_4_a1
Strnad, Pavel. On optimum time bounds for recognition of some sets of words by on-line Turing machines. Kybernetika, Tome 05 (1969) no. 4, p. 279. https://geodesic-test.mathdoc.fr/item/KYB_1969__5_4_a1/