1. Jean Berstel (1979): Transductions and Context-free Languages. Teubner, Stuttgart, doi:10.1007/978-3-663-09367-1.
  2. Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca & Carlos Martín-Vide (2006): Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369(1-3), pp. 67–81, doi:10.1016/j.tcs.2006.07.059.
  3. Stanley Burris & H. P. Sankappanavar (1981): A Course in Universal Algebra. Graduate Texts in Mathematics 78. Springer, doi:10.1007/978-1-4613-8130-3_7.
  4. Didier Caucal (1992): On the Regular Structure of Prefix Rewriting. Theor. Comput. Sci. 106(1), pp. 61–86, doi:10.1016/0304-3975(92)90278-N.
  5. Didier Caucal (2003): On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1), pp. 79–115, doi:10.1016/S0304-3975(01)00089-5.
  6. Didier Caucal (2003): On the transition graphs of turing machines. Theor. Comput. Sci. 296(2), pp. 195–223, doi:10.1016/S0304-3975(02)00655-2.
  7. Edmund M. Clarke, Orna Grumberg & Doron Peled (2004): Model checking, 5. print. edition. MIT Press, Cambridge, Mass. [u.a.].
  8. Bruno Courcelle & Irène Durand (2012): Automata for the verification of monadic second-order graph properties. J. Applied Logic 10(4), pp. 368–409, doi:10.1016/j.jal.2011.07.001.
  9. Alan Pierce (2011): Decision Problems on Iterated Length-Preserving Transducers. Unpublished manuscript.
  10. Chloe Rispal (2002): The synchronized graphs trace the context-sensitive languages. Electr. Notes Theor. Comput. Sci. 68(6), pp. 55–70, doi:10.1016/S1571-0661(04)80533-4.
  11. Sasha Rubin (2008): Automata Presenting Structures: A Survey of the Finite String Case. Bulletin of Symbolic Logic 14(2), pp. 169–209, doi:10.2178/bsl/1208442827.
  12. Wolfgang Thomas (2001): A Short Introduction to Infinite Automata. In: Werner Kuich, Grzegorz Rozenberg & Arto Salomaa: Developments in Language Theory, Lecture Notes in Computer Science 2295. Springer, pp. 130–144, doi:10.1007/3-540-46011-X_10.
  13. David J. Weir (1992): A Geometric Hierarchy Beyond Context-Free Languages. Theor. Comput. Sci. 104(2), pp. 235–261, doi:10.1016/0304-3975(92)90124-X.

Comments and questions to:
For website issues: