1. Benois M., Descendants of regular language in a class of rewriting systems: algorithm and complexity of an automata construction, inProc. of RTA 87.Lect. Notes Comput. Sci.256(1987) 121–132.
2. J. Berstel,Transductions and Context-free Languages. Teubner, Stuttgart (1979).
3. Bestvina M. and Handel M., Train tracks and automorphisms of free groups.Ann. Math.135(1992) 1–51.
4. Bogopolski O., Martino A., Maslakova O. and Ventura E., The conjugacy problem is solvable in free-by-cyclic groups.Bull. Lond. Math. Soc.38(2006) 787–794.
5. R.V. Book and F. Otto,String-Rewriting Systems. Springer-Verlag, New York (1993).