Geodesic
On optimum time bounds for recognition of some sets of words by on-line Turing machines
Kybernetika, Tome 5 (1969) no. 4, pp. 266-279 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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 = {266--279},
     year = {1969},
     volume = {5},
     number = {4},
     mrnumber = {0323158},
     zbl = {0184.02303},
     language = {en},
     url = {http://geodesic.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  - 266
EP  - 279
VL  - 5
IS  - 4
UR  - http://geodesic.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 266-279
%V 5
%N 4
%U http://geodesic.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 5 (1969) no. 4, pp. 266-279. http://geodesic.mathdoc.fr/item/KYB_1969_5_4_a1/

[1] F. C. Hennie: On-line Turing machine computations. IEEE Transactions on Electronic Computers EC-15 (February 1966), 1, 35-44. | Zbl