×

zbMATH — the first resource for mathematics

Verbal subautomata and the completeness problem. (Russian) Zbl 0577.68065
The completeness problem for systems of finite automata in the class of finite automata with the operations of cascade connection and taking a verbal subautomaton is considered. A criterion for the completeness is obtained and maximal subalgebras in this functional system are described.
Reviewer: A.V.Anisimov

MSC:
68Q70 Algebraic theory of languages and automata
PDF BibTeX XML Cite