1. J.M. Autebert, J. Berstel, L. Boasson 1997. Context-free languages and Pushdown Automata. Handbook of formal languages, 1: 111–174, Springer, Berlin.
2. J. Dassow, V. Mitrana, A. Salomaa. 2002. Operations and language generating devices suggested by the genome evolution. Theoretical Computer Science, 270:701–738.
3. A. Ehrenfeucht, D.M. Prescott, G. Rozenberg. 2001. Computational aspects of gene (un)scrambling is ciliates. In Evolution as Computation (L.F. Landweber, E. Winfree eds.) Springer-Verlag, Berlin, Heidelberg, 45–86.
4. S. Ginsburg. 1975. Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam.
5. L. Kari, L.F. Landweber. 2000. Computational power of gene rearrangment In DNA5, DIMACS series in Discrete Mathematics and Theoretical Computer Science)(E. Winfree, D. Gifford eds.), American Mathematical Society, 54: 207–216.