1. Problems related to shortest strings in formal languages;Ang,2010
2. A note about minimal non-deterministic automata;Arnold;Bull. Eur. Assoc. Theor. Comput. Sci.,1992
3. Computational Complexity: A Modern Approach;Arora,2009
4. On two algorithmic problems about synchronizing automata;Berlinkov,2014
5. Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems;Booth;SIAM J. Comput.,1978