Primitive and irreducible automata

DOI10.1007/S10559-015-9742-9MaRDI QIDQ747295zbMATH OpenOpenAlexFDO

Authors 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

automatonsemigroupmonoid

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1033559
• Automaticity of primitive words and irreducible polynomials
• Automata accepting primitive words
• Automata and algebraicity
• Minimal and reduced reversible automata
• Minimal and Reduced Reversible Automata
• Undecidability and finite automata
• A class of semisimple automata
• scientific article; zbMATH DE number 1333447
• scientific article; zbMATH DE number 1678376

Cites work

• scientific article; zbMATH DE number 3902880 (Why is no real title available?)
• scientific article; zbMATH DE number 3382655 (Why is no real title available?)
• A counter example to a conjecture concerning synchronizing words in finite automata
• A theory of transformation monoids: combinatorics and representation theory
• Matrix Mortality and the Černý-Pin Conjecture
• Representations of regular ideals in finite automata

Cited in

(6)

• Semisimple synchronizing automata and the Wedderburn-Artin theory
• scientific article; zbMATH DE number 1484331 (Why is no real title available?)
• A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
• Embeddings of local automata
• Prime automata do not exist
• Automaticity of primitive words and irreducible polynomials

This page was built for publication: Primitive and irreducible automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747295)