Geodesic
On families recognizable by finite branching automata
Kybernetika, Tome 13 (1977) no. 5, pp. 293-319 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68A25, 68A30, 68Q45 
@article{KYB_1977_13_5_a0,
     author = {Benda, V\'aclav and Bendov\'a, Kamila},
     title = {On families recognizable by finite branching automata},
     journal = {Kybernetika},
     pages = {293--319},
     year = {1977},
     volume = {13},
     number = {5},
     mrnumber = {0464712},
     zbl = {0374.94040},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1977_13_5_a0/}
}
TY  - JOUR
AU  - Benda, Václav
AU  - Bendová, Kamila
TI  - On families recognizable by finite branching automata
JO  - Kybernetika
PY  - 1977
SP  - 293
EP  - 319
VL  - 13
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/KYB_1977_13_5_a0/
LA  - en
ID  - KYB_1977_13_5_a0
ER  - 
%0 Journal Article
%A Benda, Václav
%A Bendová, Kamila
%T On families recognizable by finite branching automata
%J Kybernetika
%D 1977
%P 293-319
%V 13
%N 5
%U http://geodesic.mathdoc.fr/item/KYB_1977_13_5_a0/
%G en
%F KYB_1977_13_5_a0
Benda, Václav; Bendová, Kamila. On families recognizable by finite branching automata. Kybernetika, Tome 13 (1977) no. 5, pp. 293-319. http://geodesic.mathdoc.fr/item/KYB_1977_13_5_a0/

[1] I. M. Havel: Finite Branching Automata. Kybernetika 10 (1974), 281-302. | MR | Zbl

[2] V. Benda K. Bendová: On specific features of recognizable families of languages. In: Mathematical Foundations of Computer Science (A. Mazurkiewicz, Ed.). Lecture Notes in Computer Science 45, Springer-Verlag, Berlin 1976, 187-193.

[3] V. Benda K. Bendová: Recognizable Filters and Ideals. CMUC 17, 2 (1976), 251-259. | MR

[4] I. M. Havel: Finite branching automata: automata theory motivated by problem solving. In: Mathematical Foundations of Computer Science (A. Blikle, Ed.). Lecture Notes in Computer Science 28, Springer-Verlag, Berlin 1975, 53-61. | MR | Zbl

[5] I. M. Havel: On the branching structure of languages. In: Mathematical Foundations of Computer Science (A. Mazurkiewicz, Ed.). Lecture Notes in Computer Science 45, Springer-Verlag, Berlin 1976, 81-98. | Zbl

[6] S. Eilenberg: Automata, Languages and Machines. Volume A. Academic Press, New York 1974. | MR | Zbl

[7] P. M. Cohn: Universal Algebra. Harper and Rower, New York 1965. | MR | Zbl

[8] A. Ginzburg: Algebraic Theory of Automata. Academic Press, New York-London 1968. | MR | Zbl