Geodesic
On a certain event recognizable in real time
Kybernetika, Tome 8 (1972) no. 2, pp. 149-153 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 03D10, 68A25 
@article{KYB_1972_8_2_a3,
     author = {Nekvinda, Miloslav},
     title = {On a certain event recognizable in real time},
     journal = {Kybernetika},
     pages = {149--153},
     year = {1972},
     volume = {8},
     number = {2},
     mrnumber = {0327081},
     zbl = {0235.02033},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1972_8_2_a3/}
}
TY  - JOUR
AU  - Nekvinda, Miloslav
TI  - On a certain event recognizable in real time
JO  - Kybernetika
PY  - 1972
SP  - 149
EP  - 153
VL  - 8
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/KYB_1972_8_2_a3/
LA  - en
ID  - KYB_1972_8_2_a3
ER  - 
%0 Journal Article
%A Nekvinda, Miloslav
%T On a certain event recognizable in real time
%J Kybernetika
%D 1972
%P 149-153
%V 8
%N 2
%U http://geodesic.mathdoc.fr/item/KYB_1972_8_2_a3/
%G en
%F KYB_1972_8_2_a3
Nekvinda, Miloslav. On a certain event recognizable in real time. Kybernetika, Tome 8 (1972) no. 2, pp. 149-153. http://geodesic.mathdoc.fr/item/KYB_1972_8_2_a3/

[1] Bečvář J.: Real-Time and Complexity Problems in Automata Theory. Kybernetika 1 (1965), 6, 475-498.

[2] 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.