References

  1. J. Büchi & L. Landweber (1969): Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society. Available at http://dx.doi.org/10.1090/S0002-9947-1969-0280205-0.
  2. A. Carayol & C. Löding (2012): Uniformization in Automata Theory. To appear in: Logic, Methodology and Philosophy of Science. Proceedings of the Fourteenth International congress. P. Schroeder-Heister, G. Heinzmann, W. Hodges, P. Edouard Bour, eds., London: College Publications.
  3. A. Church (1962): Logic, arithmetic and automata. In: Proceedings of the international congress of mathematicians, pp. 23–35.
  4. Hu. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison & M. Tommasi (2007): Tree Automata Techniques and Applications. Available at http://www.grappa.univ-lille3.fr/tata. Release October, 12th 2007.
  5. J. Engelfriet (1978): On Tree Transducers for Partial Functions. Inf. Process. Lett. 7(4), pp. 170–172. Available at http://dx.doi.org/10.1016/0020-0190(78)90060-1.
  6. F. Gèsceg & M. Steinby (1984): Tree automata. Akademiai Kiado.
  7. E. Grädel, W. Thomas & T. Wilke (2002): Automata, Logics, and Infinite Games. Lecture Notes in Compter Science 2500. Springer.
  8. Erich Grädel (2007): Finite Model Theory and Descriptive Complexity. In: Finite Model Theory and Its Applications. Springer, pp. 125–230. Available at http://dx.doi.org/10.1007/3-540-68804-8_3.
  9. M. Holtmann, Ł. Kaiser & W. Thomas (2010): Degrees of lookahead in regular infinite games. In: Foundations of Software Science and Computational Structures. Springer, pp. 252–266. Available at http://dx.doi.org/10.1007/978-3-642-12032-9_18.
  10. F. Hosch & L. Landweber (1972): Finite Delay Solutions for Sequential Conditions.. In: ICALP, pp. 45–60.
  11. C. Löding (2009): Logic and automata over infinite trees. Habilitation Thesis, RWTH Aachen, Germany.
  12. T. Milo, D. Suciu & V. Vianu (2003): Typechecking for XML transformers. J. Comput. Syst. Sci. 66(1), pp. 66–97. Available at http://dx.doi.org/10.1016/S0022-0000(02)00030-2.
  13. F.P. Ramsey (1930): On a problem of formal logic. Proceedings of the London Mathematical Society 2(1), pp. 264. Available at http://dx.doi.org/10.1007/978-0-8176-4842-8_1.
  14. S. Winter (2013): Uniformization of Automaton Definable Tree Relations. Masterthesis, RWTH Aachen, Germany.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org