Relace representované $n$-páskovými automaty
Kybernetika, Tome 3 (1967) no. 4, pp. 321-345
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1967_3_4_a1,
author = {\v{C}ul{\'\i}k, Karel II},
title = {Relace representovan\'e $n$-p\'askov\'ymi automaty},
journal = {Kybernetika},
pages = {321--345},
year = {1967},
volume = {3},
number = {4},
zbl = {0149.24903},
language = {cs},
url = {http://geodesic.mathdoc.fr/item/KYB_1967_3_4_a1/}
}
Čulík, Karel II. Relace representované $n$-páskovými automaty. Kybernetika, Tome 3 (1967) no. 4, pp. 321-345. http://geodesic.mathdoc.fr/item/KYB_1967_3_4_a1/
[1] Berge C.: Theorie des graphes et ses applications. Paris 1958. | MR
[2] Čulík Karel: Some notes on finite state languages and events represented by finite automata using labelled graphs. Časopis pro pěstování matematiky 86 (1961), 43 - 55. | MR
[3] Čulík Karel, Havel Ivan: On multiple finite automata. (V tisku.)
[4] Rabin M. O., Scott D.: Finite automata and their decision problems. IBM J. of Research and Development 3 (1959), 115-125. | DOI | MR
[5] Elgot C. C., Mezei J. E.: On finite relations defined by generalised automata. IBM J. of Research and Development 9 (1965), 47-68. | DOI | MR
[6] Ginsburg S.: Mathematical Machine Theory. Addison-Wesley, 1962. | Zbl