Reset sequences for monotonic automata
SIAM Journal on Computing
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
Minimum length synchronizing sequences of finite state machine
DAC '93 Proceedings of the 30th international Design Automation Conference
Optimal estimation on the order of local testability of finite automata
Theoretical Computer Science - Special issue on implementing automata
An algorithmic approach to the automated design of parts orienters
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Establishing certain bounds concerning finite automata
Journal of Computer and System Sciences
An inverse automata algorithm for recognizing 2-collapsing words
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
Shortest Synchronizing Strings for Huffman Codes
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Shortest synchronizing strings for Huffman codes
Theoretical Computer Science
Černý's conjecture and group representation theory
Journal of Algebraic Combinatorics: An International Journal
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On a conjecture by Carpi and D'Alessandro
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
Slowly synchronizing automata and digraphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
COMPAS: a computing package for synchronization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Effective synchronizing algorithms
Expert Systems with Applications: An International Journal
Application of hierarchical classifier to minimal synchronizing word problem
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
Generating small automata and the Černý conjecture
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Černy had found in 1964 a sequence of n-state complete DFA with shortest synchronizing word of length (n–1)2. He had conjectured that it is an upper bound for the length of the shortest synchronizing word for any n-state complete DFA. The examples of DFA with shortest synchronizing word of length (n–1)2 are relatively rare. To the Černy sequence were added in all examples of Černy, Piricka and Rosenauerova (1971), of Kari (2001) and of Roman (2004). By help of a program based on some effective algorithms, a wide class of automata of size less than 11 was checked. The order of the algorithm finding synchronizing word is quadratic for overwhelming majority of known to date automata. Some new examples of n-state DFA with minimal synchronizing word of length (n–1)2 were discovered. The program recognized some remarkable trends concerning the length of the minimal synchronizing word.