Primitive and irreducible automata
From MaRDI portal
Publication:747295
DOI10.1007/S10559-015-9742-9zbMATH Open1341.68125OpenAlexW2337165559MaRDI QIDQ747295FDOQ747295
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
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
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- A theory of transformation monoids: combinatorics and representation theory
- A counter example to a conjecture concerning synchronizing words in finite automata
- Representations of regular ideals in finite automata
- Title not available (Why is that?)
- Matrix Mortality and the Černý-Pin Conjecture
- Title not available (Why is that?)
Cited In (6)
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- Title not available (Why is that?)
- 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)
