Syntactic semiring and universal automaton

Warning

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

Authors	POLÁK Libor
Year of publication	2003
Type	Article in Proceedings
Conference	Proc. Developments in Language Theory
MU Faculty or unit	Faculty of Science
Citation
Field	General mathematics
Keywords	syntactic semiring; universal automaton
Description	We discuss the relationships between the minimal automaton, the universal automaton, the syntactic monoid and the syntactic semiring of a given regular language. We use certain completions and reductions of the transformation matrix of the minimal automaton to clarify those connections.
Related projects:	Mathematical structures of algebra and geometry