1. Bozapalidis, S., Kalampakas, A.: Recognizability of graph and pattern languages. Acta Inform. 42(8/9), 553–581 (2006)
2. Lecture Notes in Computer Science;S. Bozapalidis,2009
3. Bozapalidis, S., Kalampakas, A.: On the syntactic complexity of tree series. RAIRO-Theor. Inf. Appl. 44, 257–279 (2010)
4. 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, DCFS, pp. 25–42 (2009), Extended abstract at http://arxiv.org/abs/0907.4547
5. Lecture Notes in Computer Science;J. Brzozowski,2010