Recognizable filters and ideals
Commentationes Mathematicae Universitatis Carolinae, Tome 17 (1976) no. 2, pp. 251-259
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{CMUC_1976_17_2_a3,
author = {Benda, V\'aclav and Bendov\'a, Kamila},
title = {Recognizable filters and ideals},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {251--259},
year = {1976},
volume = {17},
number = {2},
mrnumber = {0411246},
zbl = {0334.02020},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1976_17_2_a3/}
}
Benda, Václav; Bendová, Kamila. Recognizable filters and ideals. Commentationes Mathematicae Universitatis Carolinae, Tome 17 (1976) no. 2, pp. 251-259. http://geodesic.mathdoc.fr/item/CMUC_1976_17_2_a3/
[1] HAVEL I. M.: Finite Branching Automata. Kybernetika 10 (1974), 281-302. | MR | Zbl
[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
[5] EILENBERG S.: Automata, Languages and Machines. Vol. A, Academic Press, New York 1974. | MR | Zbl
[6] VOPĚNKA P., HÁJEK P.: The Theory of Semisets. Academia, Prague and North-Holland, Amsterdam, 1972. | MR