Reset thresholds of transformation monoids
From MaRDI portal
Publication:6547250
DOI10.1007/S10559-024-00660-ZzbMATH Open1541.68232MaRDI QIDQ6547250
Publication date: 30 May 2024
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primitive groups synchronize non-uniform maps of extreme ranks
- A theory of transformation monoids: combinatorics and representation theory
- Reset words for commutative and solvable automata
- Almost optimal bound of recurrent word length for regular automata
- On the interplay between Babai and Černý's conjectures
- Between primitive and 2-transitive: synchronization and its friends
- Completely Reachable Automata
- Matrix Mortality and the Černý-Pin Conjecture
- Estimation of the length of reset words for automata with simple idempotents
- Completely reachable automata: a polynomial algorithm and quadratic upper bounds
This page was built for publication: Reset thresholds of transformation monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547250)
