Reset sequences for monotonic automata
SIAM Journal on Computing
Composition sequences for functions over a finite domain
Theoretical Computer Science
Synchronization of finite automata: contributions to an old problem
The essence of computation
Synchronizing monotonic automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
A series of slowly synchronizing automata with a zero state over a small alphabet
Information and Computation
Shortest Synchronizing Strings for Huffman Codes
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On monogenic nondeterministic automata
Acta Cybernetica
Shortest synchronizing strings for Huffman codes
Theoretical Computer Science
Synchronizing automata preserving a chain of partial orders
Theoretical Computer Science
Černý's conjecture and group representation theory
Journal of Algebraic Combinatorics: An International Journal
Synchronizing automata preserving a chain of partial orders
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On the hybrid Černý-road coloring problem and Hamiltonian paths
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The averaging trick and the Černý conjecture
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Approximating minimum reset sequences
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
The mortality threshold for partially monotonic automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Synchronizing automata with a letter of deficiency 2
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The Synchronizing Probability Function of an Automaton
SIAM Journal on Discrete Mathematics
Syntactic complexities of some classes of star-free languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
In an earlier paper, we have studied reset words for synchronizing automata whose states admit a stable linear order. Here we show that the same bound on the length of the shortest reset word persists for synchronizing automata satisfying much weaker stability restriction. This result supports our conjecture concerning the length of reset words for synchronizing automata accepting only star-free languages.