Reset thresholds of transformation monoids

DOI10.1007/S10559-024-00660-ZMaRDI QIDQ6547250zbMATH OpenFDO

Authors I. K. Rystsov, Marek Szykuła

Publication date 30 May 2024

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

Full work available at URL https://doi.org/10.1007/S10559-024-00660-Z

zbMATH Keywords

finite automatonfinite monoidtransformation monoidČerný conjecture

Mathematics Subject Classification ID

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

Recommendations

• On the interplay between Babai and Černý's conjectures
• On the interplay between Černý and Babai's conjectures
• Some contributions to the theory of transformation monoids
• Matrix Mortality and the Černý-Pin Conjecture
• The Černý conjecture for automata respecting intervals of a directed graph

Cites work

• A theory of transformation monoids: combinatorics and representation theory
• Almost optimal bound of recurrent word length for regular automata
• Between primitive and 2-transitive: synchronization and its friends
• Completely reachable automata
• Completely reachable automata: a polynomial algorithm and quadratic upper bounds
• Estimation of the length of reset words for automata with simple idempotents
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• scientific article; zbMATH DE number 3354928 (Why is no real title available?)
• Matrix Mortality and the Černý-Pin Conjecture
• On the interplay between Babai and Černý's conjectures
• Primitive groups synchronize non-uniform maps of extreme ranks
• Reset words for commutative and solvable automata

Cited in

(1)

• A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group

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)