KLÍMA, Ondřej and Libor POLÁK. On varieties of meet automata. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2008, vol. 407, 1-3, p. 278-289. ISSN 0304-3975. |
Other formats:
BibTeX
LaTeX
RIS
|
Basic information | |
---|---|
Original name | On varieties of meet automata |
Name in Czech | Variety průsekových automatů |
Authors | KLÍMA, Ondřej (203 Czech Republic) and Libor POLÁK (203 Czech Republic, guarantor). |
Edition | Theoretical Computer Science, Amsterdam, Nizozemí, Elsevier, 2008, 0304-3975. |
Other information | |
---|---|
Original language | English |
Type of outcome | Article in a journal |
Field of Study | 10101 Pure mathematics |
Country of publisher | Netherlands |
Confidentiality degree | is not subject to a state or trade secret |
Impact factor | Impact factor: 0.806 |
RIV identification code | RIV/00216224:14310/08:00025040 |
Organization unit | Faculty of Science |
UT WoS | 000260975400019 |
Keywords in English | varieties of languages; varieties of meet automata; varieties of semiring homomorphisms |
Tags | varieties of languages, varieties of meet automata, varieties of semiring homomorphisms |
Tags | International impact, Reviewed |
Changed by | Changed by: doc. Mgr. Ondřej Klíma, Ph.D., učo 3868. Changed: 18/6/2009 19:26. |
Abstract |
---|
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite semigroups. The second author gave a similar relation between conjunctive varieties of languages and varieties of semiring homomorphisms. In this paper, we add a third component to this result by considering varieties of meet automata. We consider three significant classes of languages, two of them consisting of reversible languages. We present conditions on meet automata and identities for semiring homomorphisms for their characterization. |
Abstract (in Czech) |
---|
Eilenbergova věta o varietách popisuje jednoznačnou korespondenci mezi varietami jazyků a varietami konečných pologrup. Druhý autor popsal podobnou korespondenci mezi konjunktivními varietami jazyků a varietami polookruhových homomorfismů. V tomto článku přidáváme třetí komponentu - uvažujeme též variety průsekových automatů. Ukazujeme tři podstatné příklady tříd jazyků, z nichž dva pracují s reversibilními jazyky. Pro jejich popis dáváme charakterizujicí podmínky. |
Links | |
---|---|
GA201/06/0936, research and development project | Name: Algebraické metody v teorii automatů a formálních jazyků |
Investor: Czech Science Foundation, Algebraic Methods in Automata and Formal Language Theory | |
MSM0021622409, plan (intention) | Name: Matematické struktury a jejich fyzikální aplikace |
Investor: Ministry of Education, Youth and Sports of the CR, Mathematical structures and their physical applications | |
1M0545, research and development project | Name: Institut Teoretické Informatiky |
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science |
PrintDisplayed: 8/9/2024 06:42