Advertisement

An Automata Theoretic Approach to Rational Tree Relations

  • Frank G. Radmacher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4910)

Abstract

We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg. Math. Soc. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. The automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness problem). The second contribution of this paper is a new subclass of the rational tree relations, called separate-rational tree relations, defined via a natural restriction on asynchronous tree automata. These relations are closed under composition, preserve regular tree languages, and generate precisely the regular sets in the unary case (all these properties fail for the general model), and they are still more powerful than, for instance, the automatic tree relations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berstel, J.: Transductions and Context-Free Languages. Leitfäden der angewandten Mathematik und Mechanik 38. Teubner, Stuttgart (1979)Google Scholar
  2. 2.
    Blumensath, A., Grädel, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems 37, 641–674 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Carton, O., Choffrut, C., Grigorieff, S.: Decision problems among the main subfamilies of rational relations. Theor. Informat. Appl. 40(2), 255–275 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Unpublished electronic book (1997), http://www.grappa.univ-lille3.fr/tata
  5. 5.
    Cristau, J., Löding, C., Thomas, W.: Deterministic automata on unranked trees. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 68–79. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1974)zbMATHGoogle Scholar
  7. 7.
    Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development 9(1), 47–68 (1965)zbMATHMathSciNetGoogle Scholar
  8. 8.
    Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. Journal of Computer and System Sciences 2(1), 88–101 (1968)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Gécseg, F., Steinby, M.: Tree Automata, Akadémiai Kiadó, Budapest (1984)Google Scholar
  10. 10.
    Gécseg, F., Steinby, M.: Tree Languages. In: Handbook of Formal Languages, Beyond Words, vol. 3, pp. 1–68. Springer, Heidelberg (1997)Google Scholar
  11. 11.
    Grigorieff, S.: Modelization of deterministic rational relations. Theoretical Computer Science 281(1-2), 423–453 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Meyer, A.: On term rewriting systems having a rational derivation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 378–392. Springer, Heidelberg (2004)Google Scholar
  13. 13.
    Pelletier, M., Sakarovitch, J.: On the representation of finite deterministic 2-tape automata. Theoretical Computer Science 225(1-2), 1–63 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3(2), 115–125 (1959)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Radmacher, F.G.: An automata theoretic approach to the theory of rational tree relations. Tech. Rep. (2007), http://www.automata.rwth-aachen.de/~radmacher/
  16. 16.
    Radmacher, F.G.: Automatendefinierbare Relationen über Bäumen (Automata Definable Relations over Trees). Diploma thesis (revised version), RWTH Aachen (2007), http://www.automata.rwth-aachen.de/~radmacher/
  17. 17.
    Raoult, J.-C.: A survey of tree transductions. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 311–326. Elsevier, Amsterdam (1992) (also published as report 1410 INRIA-Rennes, 1991)Google Scholar
  18. 18.
    Raoult, J.-C.: Rational tree relations. Bulletin of the Belgian Mathematical Society 4(1), 149–176 (1997)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Frank G. Radmacher
    • 1
  1. 1.Lehrstuhl für Informatik 7, RWTH AachenGermany

Personalised recommendations