×

On families recognizable by finite branching automata. (English) Zbl 0374.94040


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: EuDML

References:

[1] I. M. Havel: Finite Branching Automata. Kybernetika 10 (1974), 281-302. · Zbl 0287.94050
[2] V. Benda K. Bendová: On specific features of recognizable families of languages. Mathematical Foundations of Computer Science (A. Mazurkiewicz. 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. · Zbl 0334.02020
[4] I. M. Havel: Finite branching automata: automata theory motivated by problem solving. Mathematical Foundations of Computer Science (A. Blikle. Lecture Notes in Computer Science 28, Springer-Verlag, Berlin 1975, 53-61. · Zbl 0306.68039
[5] I. M. Havel: On the branching structure of languages. Mathematical Foundations of Computer Science (A. Mazurkiewicz. 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. · Zbl 0317.94045
[7] P. M. Cohn: Universal Algebra. Harper and Rower, New York 1965. · Zbl 0141.01002
[8] A. Ginzburg: Algebraic Theory of Automata. Academic Press, New York-London 1968. · Zbl 0195.02501
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.