Automata without internal memory
Časopis pro pěstování matematiky (1967)
- Volume: 092, Issue: 2, page 193-205
- ISSN: 0528-2195
Access Full Article
top
How to cite
topHořejš, Jiří. "Automaty bez vnitřní paměti." Časopis pro pěstování matematiky 092.2 (1967): 193-205. <http://eudml.org/doc/18966>.
@article{Hořejš1967,
author = {Hořejš, Jiří},
journal = {Časopis pro pěstování matematiky},
keywords = {recursion theory, constructive mathematics},
language = {cze},
number = {2},
pages = {193-205},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Automaty bez vnitřní paměti},
url = {http://eudml.org/doc/18966},
volume = {092},
year = {1967},
}
TY - JOUR
AU - Hořejš, Jiří
TI - Automaty bez vnitřní paměti
JO - Časopis pro pěstování matematiky
PY - 1967
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 092
IS - 2
SP - 193
EP - 205
LA - cze
KW - recursion theory, constructive mathematics
UR - http://eudml.org/doc/18966
ER -
References
top- J. Bečvář, Real time and complexity problems in automata theory, Kybernetika I, č. 6 (1965), 476-498. (1965)
- S. C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, Princeton 1956. (1956) MR0077478
- J. Myhill, Linear bounded automata, WADD technical note 60-165.
- M. O. Rabin, Real time computation, Israel J. of Math. vol. I, n. 4 (1963) 203-211. (1963) Zbl0156.25603MR0163849
- C. E. Shannon, Universal Turing machine with two internal states, Automata Studies, Princeton 1956. (1956)
- Wang, Hao, A variant to Turing's theory of calculating machines, JACM 4 (1957), 63-92 (1957) MR0098029
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.