Minimal initializing word: a contribution to Cˇerny´'s conjecture
Journal of Automata, Languages and Combinatorics
Synchronization of Finite Automata. Contributions to an Old Problem
Synchronization of Finite Automata. Contributions to an Old Problem
Synchronizing groups and automata
Theoretical Computer Science
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
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
The Synchronization Problem for Strongly Transitive Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Genetic Algorithm for Synchronization
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
On a conjecture by Carpi and D'Alessandro
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
Slowly synchronizing automata and digraphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Approximating minimum reset sequences
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Complexity of problems concerning reset words for cyclic and Eulerian automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Lower bounds for the length of reset words in Eulerian automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Synchronizing automata with a letter of deficiency 2
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Minimal eulerian circuit in a labeled digraph
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Complexity of problems concerning reset words for cyclic and Eulerian automata
Theoretical Computer Science
The Synchronizing Probability Function of an Automaton
SIAM Journal on Discrete Mathematics
Synchronizing automata on quasi-eulerian digraph
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Synchronizing automata of bounded rank
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Cerný's conjecture and the road coloring problem are two open problems concerning synchronization of finite automata. We prove these conjectures in the special case that the vertices have uniform in- and outdegrees.