Primitive and irreducible automata

DOI10.1007/s10559-015-9742-9zbMath1341.68125OpenAlexW2337165559MaRDI QIDQ747295

I. K. Rystsov

Publication date: 23 October 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9742-9

zbMATH Keywords

semigroupmonoidautomaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number ⋮ Semisimple Synchronizing Automata and the Wedderburn-Artin Theory

Cites Work

• Representations of regular ideals in finite automata
• A theory of transformation monoids: combinatorics and representation theory
• Matrix Mortality and the Černý-Pin Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Primitive and irreducible automata