On a certain event recognizable in real time
Kybernetika (1972)
- Volume: 08, Issue: 2, page (149)-153
- ISSN: 0023-5954
Access Full Article
top
How to cite
topNekvinda, Miloslav. "On a certain event recognizable in real time." Kybernetika 08.2 (1972): (149)-153. <http://eudml.org/doc/28090>.
@article{Nekvinda1972,
author = {Nekvinda, Miloslav},
journal = {Kybernetika},
language = {eng},
number = {2},
pages = {(149)-153},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On a certain event recognizable in real time},
url = {http://eudml.org/doc/28090},
volume = {08},
year = {1972},
}
TY - JOUR
AU - Nekvinda, Miloslav
TI - On a certain event recognizable in real time
JO - Kybernetika
PY - 1972
PB - Institute of Information Theory and Automation AS CR
VL - 08
IS - 2
SP - (149)
EP - 153
LA - eng
UR - http://eudml.org/doc/28090
ER -
References
top- Bečvář J., Real-Time and Complexity Problems in Automata Theory, Kybernetika 1 (1965), 6, 475-498. (1965)
- Hartmanis J., Stearns R. E., Computational complexity of recursive sequences, In: Pгoc. of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, held at Princeton University, 1964, 82-90. (1964)
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.