1. J. Čern’y, “Poznámka kHomogé nnym Eksperimentom s Konečný mi Automatami,” Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14(3), 208–216 (1964).
2. I. Rystsov, “Reset Words for Commutative and Solvable Automata,” Theoret. Comput. Sci. 172(1–2), 273–279 (1997).
3. M. P. Schützenberger, “On FiniteMonoids Having Only Trivial Subgroups,” Inf. Control 8, 190–194 (1965).
4. D. S. Ananichev and M. V. Volkov, “Synchronizing Generalized Monotonic Automata,” Theoret. Comput. Sci. 330(1), 3–13 (2005).
5. A. N. Trahtman, “The Černý Conjecture for Aperiodic Automata,” Discrete Math. Theoret. Comput. Sci. 9(2), 3–10 (2007).