References

  1. Rajeev Alur & P. Madhusudan (2009): Adding nesting structure to words. Journal of the ACM 56(3), pp. 1–43, doi:10.1145/1516512.1516518.
  2. Hubert Comon, Max Dauchet, Rémi Gilleron, Christof Löding, Florent Jacquemard, Denis Lugiez, Sophie Tison & Marc Tommasi (2007): Tree Automata Techniques and Applications. Available at http://tata.gforge.inria.fr/.
  3. Joost Engelfriet & Sebastian Maneth (2003): Macro tree translations of linear size increase are MSO definable. SIAM Journal on Computing 32, pp. 950–1006, doi:10.1137/S0097539701394511.
  4. Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier & Frédéric Servais (2011): Streamability of Nested Word Transductions. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 13, pp. 312–324, doi:10.4230/LIPIcs.FSTTCS.2011.312.
  5. Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais & Jean-Marc Talbot (2010): Properties of Visibly Pushdown Transducers. In: Mathematical Foundations of Computer Science, pp. 355–367, doi:10.1007/978-3-642-15155-2_32.
  6. Emmanuel Filiot & Frédéric Servais (2012): Visibly Pushdown Transducers with Look-Ahead. In: International Conference on Current Trends in Theory and Practice of Computer Science, pp. 251–263, doi:10.1007/978-3-642-27660-6_21.
  7. Sebastian Maneth (2003): The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 326–337, doi:10.1007/978-3-540-24597-1_28.
  8. Wim Martens & Frank Neven (2003): Typechecking Top-Down Uniform Unranked Tree Transducers. In: International Conference on Database Theory, Lecture Notes in Computer Science 2572. Springer, pp. 64–78, doi:10.1007/3-540-36285-1_5.
  9. Thomas Perst & Helmut Seidl (2004): Macro Forest Transducers. Information Processing Letter 89(3), pp. 141–149, doi:10.1016/j.ipl.2003.05.001.
  10. Jean-François Raskin & Frédéric Servais (2008): Visibly Pushdown Transducers. In: International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 5126, pp. 386–397, doi:10.1007/978-3-540-70583-3_32.
  11. Frédéric Servais (2011): Visibly Pushdown Transducers. Université Libre de Bruxelles. Available at http://theses.ulb.ac.be/ETD-db/collection/available/ULBetd-09292011-142239/.
  12. Slawomir Staworko, Grégoire Laurence, Aurélien Lemay & Joachim Niehren (2009): Equivalence of Deterministic Nested Word to Word Transducers. In: Fundamentals of Computer Theory, Lecture Notes in Computer Science 5699, pp. 310–322, doi:10.1007/978-3-642-03409-1_28.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org