• DML-CZ Home

68A25 

• Benda, Václav; Bendová, Kamila: On families recognizable by finite branching automata. (English). Kybernetika, vol. 13 (1977), issue 5, pp. (293)-319
• Starke, Peter H.: Closedness properties and decision problems for finite multi-tape automata. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (61)-75
• Chytil, Michal P.: Crossing-bounded computations and their relation to the LBA-problem. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (76)-85
• Zech, Karl-Adolf: On networks of non-deterministic automata. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (86)-102
• Benda, Václav; Bendová, Kamila: Recognizable filters and ideals. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 17 (1976), issue 2, pp. 251-259
• Havel, Ivan M.: Finite branching automata. (English). Kybernetika, vol. 10 (1974), issue 4, pp. (281)-302
• Adámek, Jiří: Free algebras and automata realizations in the language of categories. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 4, pp. 589-602
• Nekvinda, Miloslav: On the complexity of events recognizable in real time. (English). Kybernetika, vol. 9 (1973), issue 1, pp. (1)-10
• Pirická, Alica: Directable automata and directly subdefinite events. (English). Kybernetika, vol. 8 (1972), issue 5, pp. (395)-403
• Mareš, Jan: A note on Glushkov's algorithm of the synthesis of finite automata. (English). Kybernetika, vol. 8 (1972), issue 4, pp. (289)-296
• Nekvinda, Miloslav: On a certain event recognizable in real time. (English). Kybernetika, vol. 8 (1972), issue 2, pp. (149)-153
• Strnad, Pavel: On optimum time bounds for recognition of some sets of words by on-line Turing machines. (English). Kybernetika, vol. 5 (1969), issue 4, pp. (266)-279