On 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

POLÁK Libor

Year of publication 2007
Type Appeared in Conference without Proceedings
MU Faculty or unit

Faculty of Science

Citation
Description We factorize the Eilenberg-type theorem relating conjunctive varieties of languages and varieties of semiring homomorphisms trough the so-called varieties of meet automata. We consider three significant classes of languages, two of them related to reversible ones. We present conditions on meet automata and identities for semiring homomorphisms for their characterization.
Related projects:

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