1. A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Prentice-Hall, Englewood Cliffs, 1972.
2. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers — Principles, Techniques, and Tools, Addison-Wesley, Reading, 1986.
3. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990.
4. J. Berstel and M. Morcrette, Compact Representation of Patterns by Finite Automata, Pixim 89: L’Image Numérique à Paris, André Gagalowicz, ed., Hermes, Paris, 1989, pp. 387–395.
5. J.A. Brzozowski and E. Leiss, On Equations for Regular Languages, Finite Automata, and Sequential Networks, Theoretical Computer Science, 10 (1980), 19–35.