1. Ang, T., Brzozowski, J.: Languages convex with respect to binary relations, and their closure properties. Acta Cybernet 19, 445–464 (2009)
2. Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Internat. J. Algebra Comput. 15, 149–160 (2005)
3. Lecture Notes in Computer Science;F. Bassino,2010
4. Brzozowski, J.: Derivatives of regular expressions. J. ACM 11, 481–494 (1964)
5. Brzozowski, J.: Quotient complexity of regular languages. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) 11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, pp. 25–42. Otto-von-Guericke-Universität, Magdeburg (2009),
http://arxiv.org/abs/0907.4547