Publisher
Springer International Publishing
Reference24 articles.
1. Assent, I., Seibert, S.: An upper bound for transforming self-verifying automata into deterministic ones. Theor. Inf. Appl. 41, 261–265 (2007)
2. Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119, 267–291 (1993)
3. Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15, 71–89 (2010)
4. Lecture Notes in Computer Science;P Ďuriš,1997
5. Ershov, U.L.: On a conjecture of W.U. Uspenskii. Algebra i Logika (Seminar) 1, 45–48 (1962). (in Russian)