Other formats:
BibTeX
LaTeX
RIS
@article{794655,
author = {Klíma, Ondřej and Polák, Libor},
article_location = {Amsterdam, Nizozemí},
article_number = {1-3},
keywords = {varieties of languages; varieties of meet automata; varieties of semiring homomorphisms},
language = {eng},
issn = {0304-3975},
journal = {Theoretical Computer Science},
title = {On varieties of meet automata},
volume = {407},
year = {2008}
}
TY - JOUR
ID - 794655
AU - Klíma, Ondřej - Polák, Libor
PY - 2008
TI - On varieties of meet automata
JF - Theoretical Computer Science
VL - 407
IS - 1-3
SP - 278-289
EP - 278-289
PB - Elsevier
SN - 03043975
KW - varieties of languages
KW - varieties of meet automata
KW - varieties of semiring homomorphisms
N2 - 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.
ER -
KLÍMA, Ondřej and Libor POLÁK. On varieties of meet automata. \textit{Theoretical Computer Science}. Amsterdam, Nizozemí: Elsevier, 2008, vol.~407, 1-3, p.~278-289. ISSN~0304-3975.
|
