1. M. Ackerman, J. Shallit, Efficient enumeration of regular languages, in: Proceedings of the Implementation and Application of Automata, 12th International Conference (CIAA 2007), vol. 4783, Lecture Notes in Computer Science, Springer-Verlag, 2007, pp. 226–242.
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. Intersection and union of regular languages and state complexity;Birget;Inform. Process. Lett.,1992
4. Patterns in words and languages;Castiglione;Discrete Appl. Math.,2004
5. Finite automata and unary languages;Chrobak;Theor. Comput. Sci.,1986