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

[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 0411246

[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 0381383 | Zbl 0306.68039

[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 0338.68060

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

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

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