1. Lecture Notes in Computer Science;A. Almeida,2009
2. Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theoret. Comput. Sci. 387(2), 93–102 (2007); Special issue Selected papers of DCFS 2006
3. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Fox, J. (ed.) Proc. of the Sym. on Math. Theory of Automata, NY. MRI Symposia Series, vol. 12, pp. 529–561 (1963)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT, Cambridge (2003)
5. Project FAdo. FAdo: tools for formal languages manipulation,
http://www.ncc.up.pt/FAdo
(access date:1.1.2010)