1. Campeanu, C., Santean, N., Yu, S.: Mergible states in large NFA. Theoretical Computer Science 330, 23–34 (2005)
2. Campeanu, C., Santean, N., Yu, S.: Large NFA without mergible states. In: Proceedings of 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, pp. 75–84 (2005)
3. Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Inc., Orlando (1974)
4. Grunsky, I.S., Kurganskyy, O.: Properties of languages that generated by undirected vertex-labeled graphs. In: Proceeding of 8-th International Seminar on Discrete mathematics and its applications, Moscow State University, pp. 267–269 (2004) (in Russian)
5. Lecture Notes in Computer Science;I.S. Grunsky,2005