| KLÍMA, Ondřej and Libor POLÁK. Splitting conditions for classes of meet automata. In Proceedings AutoMathA 2007, June 18-22, 2007, Palermo, Italy (CD). Palermo, Italy: University Palermo, 2007, p. 1-12. |
Other formats:
BibTeX
LaTeX
RIS
@inproceedings{755259,
author = {Klíma, Ondřej and Polák, Libor},
address = {Palermo, Italy},
booktitle = {Proceedings AutoMathA 2007, June 18-22, 2007, Palermo, Italy (CD)},
keywords = {varieties of languages; meet automata; universal automata},
language = {eng},
location = {Palermo, Italy},
pages = {1-12},
publisher = {University Palermo},
title = {Splitting conditions for classes of meet automata},
year = {2007}
}
TY - JOUR
ID - 755259
AU - Klíma, Ondřej - Polák, Libor
PY - 2007
TI - Splitting conditions for classes of meet automata
PB - University Palermo
CY - Palermo, Italy
KW - varieties of languages
KW - meet automata
KW - universal automata
N2 - In a recent paper we introduced meet automata as a new (algebraic) concept for studying natural classes of languages. We factorized the most general Eilenberg-type theorem through varieties of meet automata. The only syntactic presentation of such classes was the usage of pseudoidentities on transformation semirings of such automata. Here we present a new type of conditions suitable for identification of classes of meet automata. We found rich hierarchies of such classes, several of them related to the reversible automata.
ER -
KLÍMA, Ondřej and Libor POLÁK. Splitting conditions for classes of meet automata. In \textit{Proceedings AutoMathA 2007, June 18-22, 2007, Palermo, Italy (CD)}. Palermo, Italy: University Palermo, 2007, p.~1-12.
|
