Rational series and their languages
Rational series and their languages
Composition sequences for functions over a finite domain
Theoretical Computer Science
Sur un Cas Particulier de la Conjecture de Cerny
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
Synchronizing groups and automata
Theoretical Computer Science
Synchronizing automata with a letter of deficiency 2
Theoretical 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
Matrix Mortality and the Černý-Pin Conjecture
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
The Synchronization Problem for Locally Strongly Transitive Automata
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Černý's conjecture and group representation theory
Journal of Algebraic Combinatorics: An International Journal
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Modifying the upper bound on the length of minimal synchronizing word
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Composition sequences and synchronizing automata
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
The Synchronizing Probability Function of an Automaton
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
The results of several papers concerning the Černy conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof scheme axiomatically. Instead, authors axiomatized classes of automata to which it applies.