References

  1. Michael Benedikt, Joost Engelfriet & Sebastian Maneth (2013): Determinacy and Rewriting of Top-Down and MSO Tree Transformations. In: Krishnendu Chatterjee & JiríSgall: Mathematical Foundations of Computer Science 2013, Lecture Notes in Computer Science 8087. Springer Berlin Heidelberg, pp. 146–158, doi:10.1007/978-3-642-40313-2_15.
  2. Philip Bohannon, Wenfei Fan, Michael Flaster & P. P. S. Narayan (2005): Information preserving XML schema embedding. In: Proceedings of the 31st international conference on Very large data bases, VLDB '05. VLDB Endowment, pp. 85–96. Available at http://dl.acm.org/citation.cfm?id=1083592.1083606.
  3. Benoit Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos & Sophie Tison (2014): Static analysis of XML security views and query rewriting. Information and Computation. Available at http://hal.archives-ouvertes.fr/hal-00796297.
  4. Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki & Toru Fujiwara (2013): Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers. In: Adrian-Horia Dediu, Carlos Martín-Vide & Bianca Truthe: Language and Automata Theory and Applications, Lecture Notes in Computer Science 7810. Springer Berlin Heidelberg, pp. 335–346, doi:10.1007/978-3-642-37064-9_30.
  5. Joachim Niehren, Laurent Planque, Jean-Marc Talbot & Sophie Tison (2005): N-Ary Queries by Tree Automata. In: Gavin Bierman & Christoph Koch: Database Programming Languages, Lecture Notes in Computer Science 3774. Springer Berlin Heidelberg, pp. 217–231, doi:10.1007/11601524_14.
  6. J.W. Thatcher & J.B. Wright (1968): Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical systems theory 2(1), pp. 57–81, doi:10.1007/BF01691346.

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