Splitting conditions for classes of meet automata

Investor logo

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Science. Official publication website can be found on muni.cz.
Authors

KLÍMA Ondřej POLÁK Libor

Year of publication 2007
Type Article in Proceedings
Conference Proceedings AutoMathA 2007, June 18-22, 2007, Palermo, Italy (CD)
MU Faculty or unit

Faculty of Science

Citation
Field General mathematics
Keywords varieties of languages; meet automata; universal automata
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.