1. Alfred V. Aho, Jeffrey D. Ullman & Mihalis Yannakakis (1983): On notions of information transfer in VLSI circuits. In: Johnson, pp. 133–139. Available at
  2. Jean-Camille Birget (1992): Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43(4), pp. 185–190. Available at
  3. Jean-Camille Birget (1993): Partial orders on words, minimal elements of regular languages and state complexity. Theoret. Comput. Sci. 119(2), pp. 267–291. Available at
  4. Janusz A. Brzozowski, Galina Jirásková & Baiyu Li (2013): Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, pp. 36–52. Available at
  5. Janusz A. Brzozowski, Galina Jirásková & Chenglong Zou (2014): Quotient complexity of closed languages. Theory Comput. Syst. 54(2), pp. 277–292. Available at -013-9515-7.
  6. Cezar Câmpeanu, Kai Salomaa & Sheng Yu (2002): Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7(3), pp. 303–310.
  7. J.-M. Champarnaud, A. Khorsi & T. Paranthoën: Split and join for minimizing: Brzozowski's algorithm.. Available at
  8. Ian Glaister & Jeffrey Shallit (1996): A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59(2), pp. 75–77. Available at
  9. Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö & Michail Prilutskii (2012): Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7353. Springer. Available at
  10. Markus Holzer & Martin Kutrib (2003): Nondeterministic descriptional complexity of regular languages. Internat. J. Found. Comput. Sci. 14(6), pp. 1087–1102. Available at
  11. Juraj Hromkovic (1997): Communication complexity and parallel computing. Springer. Available at
  12. Galina Jirásková (2005): State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330(2), pp. 287–298. Available at
  13. Galina Jirásková (2012): Descriptional complexity of operations on alternating and boolean automata. In: Hirsch, pp. 196–204. Available at
  14. Galina Jirásková & Tomáš Masopust (2011): Complexity in union-free regular languages. Internat. J. Found. Comput. Sci. 22(7), pp. 1639–1653. Available at
  15. Galina Jirásková & Alexander Okhotin (2008): State complexity of cyclic shift. RAIRO Theor. Inform. Appl. 42(2), pp. 335–360. Available at
  16. Galina Jirásková & Juraj Šebej (2012): Reversal of binary regular languages. Theoret. Comput. Sci. 449, pp. 85–92. Available at
  17. David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo & Joel I. Seiferas (1983): Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston. ACM.
  18. Jui-Yi Kao, Narad Rampersad & Jeffrey Shallit (2009): On NFAs where all states are final, initial, or both. Theoret. Comput. Sci. 410(47-49), pp. 5010–5021. Available at
  19. Ernst L. Leiss (1981): Succint representation of regular languages by boolean automata. Theoret. Comput. Sci. 13, pp. 323–330. Available at
  20. A. N. Maslov (1970): Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, pp. 1266–1268 (Russian). English translation: Soviet Math. Dokl. 11 (1970) 1373–1375.
  21. Tomáš Masopust (2010): Personal communication.
  22. B. G. Mirkin (1970): On dual automata. Kibernetika (Kiev) 2, pp. 7–10 (Russian). Available at English translation: Cybernetics 2, (1966) 6–9.
  23. Narad Rampersad (2006): The state complexity of L^\voidb@x 2 and L^\voidb@x k. Inform. Process. Lett. 98(6), pp. 231–234. Available at
  24. Michael Sipser (1997): Introduction to the theory of computation. PWS Publishing Company.
  25. Sheng Yu, Qingyu Zhuang & Kai Salomaa (1994): The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125(2), pp. 315–328. Available at

Comments and questions to:
For website issues: