Cerny's conjecture for automata with simple idempotents

DOI10.1007/s10559-022-00428-3OpenAlexW4210320963WikidataQ113904054 ScholiaQ113904054MaRDI QIDQ2132068

I. K. Rystsov

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

zbMATH Keywords

finite automataČerny's conjecture

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Designs and configurations (05Bxx)

Related Items (2)

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

This page was built for publication: Cerny's conjecture for automata with simple idempotents