Previous |  Up |  Next

Article

Title: Recognizable filters and ideals (English)
Author: Benda, Václav
Author: Bendová, Kamila
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 17
Issue: 2
Year: 1976
Pages: 251-259
.
Category: math
.
MSC: 02F10
MSC: 02J05
MSC: 03D05
MSC: 20M35
MSC: 68A25
MSC: 68Q45
MSC: 94A30
idZBL: Zbl 0334.02020
idMR: MR0411246
.
Date available: 2008-06-05T20:50:56Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/105691
.
Reference: [1] HAVEL I. M.: Finite Branching Automata.Kybernetika 10 (1974), 281-302. Zbl 0287.94050, MR 0381383
Reference: [2] BENDA V., BENDOVÁ K.: On Families Recognizable by Finite Branching Automata.(in preparation).
Reference: [3] KATĚTOV M.: O základech matematického vyjadřování plánu.Mimeographed report, Faculty of Mathematics and Physics, Charles University, 1974.
Reference: [4] MALCEV A. I.: Algebraičeskije sistemy.Nauka, Moscow 1970. MR 0282908
Reference: [5] EILENBERG S.: Automata, Languages and Machines.Vol. A, Academic Press, New York 1974. Zbl 0317.94045, MR 0530382
Reference: [6] VOPĚNKA P., HÁJEK P.: The Theory of Semisets.Academia, Prague and North-Holland, Amsterdam, 1972. MR 0444473
.

Files

Files Size Format View
CommentatMathUnivCarol_017-1976-2_4.pdf 724.7Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo