1. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata (Encyclopedia of Mathematics and its Applications). Cambridge University Press, Cambridge (2009)
2. Brzozowski, J.: Quotient complexity of regular languages. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) Proceedings of the 11th International Workshop on Descriptional Complexity of Formal Systems (DFS), Magdeburg, Germany, Otto-von-Guericke-Universität, pp. 25–42 (2009); to appear, J. Autom. Lang. Comb., Extended abstract at
http://arxiv.org/abs/0907.4547
3. Brzozowski, J., Jirásková, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. In: Proceedings of the 13th International Conference on Automata and Formal Languages, AFL (to appear, 2011), Full paper at
http://arxiv.org/abs/1006.4843v3
4. LNCS;J. Brzozowski,2011
5. Ganyushkin, O., Mazorchuk, V.: Classical Finite Transformation Semigroups: An Introduction. Springer, Heidelberg (2009)