Geodesic
On the complexity of events recognizable in real time
Kybernetika, Tome 9 (1973) no. 1, pp. 1-10 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 03D05, 68A25, 68Q25, 68Q45 
@article{KYB_1973_9_1_a0,
     author = {Nekvinda, Miloslav},
     title = {On the complexity of events recognizable in real time},
     journal = {Kybernetika},
     pages = {1--10},
     year = {1973},
     volume = {9},
     number = {1},
     mrnumber = {0329320},
     zbl = {0264.94039},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1973_9_1_a0/}
}
TY  - JOUR
AU  - Nekvinda, Miloslav
TI  - On the complexity of events recognizable in real time
JO  - Kybernetika
PY  - 1973
SP  - 1
EP  - 10
VL  - 9
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KYB_1973_9_1_a0/
LA  - en
ID  - KYB_1973_9_1_a0
ER  - 
%0 Journal Article
%A Nekvinda, Miloslav
%T On the complexity of events recognizable in real time
%J Kybernetika
%D 1973
%P 1-10
%V 9
%N 1
%U http://geodesic.mathdoc.fr/item/KYB_1973_9_1_a0/
%G en
%F KYB_1973_9_1_a0
Nekvinda, Miloslav. On the complexity of events recognizable in real time. Kybernetika, Tome 9 (1973) no. 1, pp. 1-10. http://geodesic.mathdoc.fr/item/KYB_1973_9_1_a0/

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

[2] Fischer P. C.: Multi-tape and infinite-state automata. International Colloquium on Algebraic Linguistics and Automata Theory, 1964, Jerusalem, Israel.

[3] Глушков B. M.: Синтез цифровых автоматов. Физматгиз, Москва 1962. | Zbl

[4] Hartmanis J., Lewis P. M., Stearns R. E.: Classifications of Computations by time and memory requirements. IFIP Congress, New York 1965. | Zbl

[5] Hartmanis J., Stearns R. E.: On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285-306. | MR | Zbl

[6] Rabin M. O.: Real time computation. Israel J. of Math. 1 (1963), 203-211. | MR | Zbl

[7] Yamada H.: Real-time computation and recursive functions not real-time computable. IRE Trans. on Electronic Computers EC-11 (1965), 753-760. | MR

[8] Yamada H.: Counting by a class of growing automata. PhD Thesis, Moore School of Elect. Eng., University of Pennsylvania, 1960.