Estimation of the length of reset words for automata with simple idempotents
From MaRDI portal
Publication:5951300
DOI10.1007/BF02732984zbMath0999.68115MaRDI QIDQ5951300
Publication date: 2 December 2002
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Unnamed Item, On the Interplay Between Černý and Babai’s Conjectures, The Synchronizing Probability Function for Primitive Sets of Matrices, Completely distinguishable automata and the set of synchronizing words, Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees, Binary completely reachable automata, New characterizations of primitive permutation groups with applications to synchronizing automata, The Černý conjecture for one-cluster automata with prime length cycle, Some contributions to the theory of transformation monoids, Černý's conjecture and the road colouring problem, Sync-maximal permutation groups equal primitive permutation groups, Reset complexity and completely reachable automata with simple idempotents, Cerny's conjecture for automata with simple idempotents, Constrained synchronization for monotonic and solvable automata and automata with simple idempotents, Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words, Černý's conjecture and group representation theory, An Extremal Series of Eulerian Synchronizing Automata, Synchronizing Automata of Bounded Rank, Matrix Mortality and the Černý-Pin Conjecture
Cites Work
