Recognizable filters and ideals

Previous | Up | Next

Article

Recognizable filters and ideals. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 17 (1976), issue 2, pp. 251-259

MSC: 02F10, 02J05, 03D05, 20M35, 68A25, 68Q45, 94A30 | MR 0411246 | Zbl 0334.02020

References:

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

[2] BENDA V., BENDOVÁ K.: On Families Recognizable by Finite Branching Automata. (in preparation).

[3] KATĚTOV M.: O základech matematického vyjadřování plánu. Mimeographed report, Faculty of Mathematics and Physics, Charles University, 1974.

[4] MALCEV A. I.: Algebraičeskije sistemy. Nauka, Moscow 1970. MR 0282908

[5] EILENBERG S.: Automata, Languages and Machines. Vol. A, Academic Press, New York 1974. MR 0530382 | Zbl 0317.94045

[6] VOPĚNKA P., HÁJEK P.: The Theory of Semisets. Academia, Prague and North-Holland, Amsterdam, 1972. MR 0444473

Partner of