On optimum time bounds for recognition of some sets of words by on-line Turing machines
Kybernetika (1969)
- Volume: 05, Issue: 4, page (266)-279
- ISSN: 0023-5954
Access Full Article
topHow to cite
topStrnad, Pavel. "On optimum time bounds for recognition of some sets of words by on-line Turing machines." Kybernetika 05.4 (1969): (266)-279. <http://eudml.org/doc/27771>.
@article{Strnad1969,
author = {Strnad, Pavel},
journal = {Kybernetika},
keywords = {recursion theory, constructive mathematics},
language = {eng},
number = {4},
pages = {(266)-279},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On optimum time bounds for recognition of some sets of words by on-line Turing machines},
url = {http://eudml.org/doc/27771},
volume = {05},
year = {1969},
}
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
PB - Institute of Information Theory and Automation AS CR
VL - 05
IS - 4
SP - (266)
EP - 279
LA - eng
KW - recursion theory, constructive mathematics
UR - http://eudml.org/doc/27771
ER -
References
top- F. C. Hennie, On-line Turing machine computations, IEEE Transactions on Electronic Computers EC-15 (February 1966), 1, 35-44. (1966) Zbl0143.01401
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.