On classes of meet automata
| Authors | |
|---|---|
| Year of publication | 2007 |
| Type | Appeared in Conference without Proceedings |
| MU Faculty or unit | |
| 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: |