Cerny's conjecture for automata with simple idempotents
From MaRDI portal
Publication:2132068
DOI10.1007/s10559-022-00428-3WikidataQ113904054 ScholiaQ113904054MaRDI QIDQ2132068
Publication date: 27 April 2022
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-022-00428-3
Related Items
Completely distinguishable automata and the set of synchronizing words, New characterizations of primitive permutation groups with applications to synchronizing automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture for one-cluster automata with prime length cycle
- Almost optimal bound of recurrent word length for regular automata
- Černý's conjecture and group representation theory
- Reset Sequences for Monotonic Automata
- Estimation of the length of reset words for automata with simple idempotents