1. Béal, M., Berlinkov, M., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata (submitted)
2. Lecture Notes in Computer Science;M. Béal,2009
3. Lecture Notes in Computer Science;A. Carpi,2008
4. Carpi, A., D’Alessandro, F.: Strongly transitive automata and the Černý conjecture. Acta Informatica 46, 591–607 (2009)
5. Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Matematicko-fyzikalny Časopis Slovensk. Akad. Vied. 14(3), 208–216 (1964) (in Slovak)