Abstract

Trees are (data) structures used in many areas of human activity. Tree as the formal notion has been introduced in the theory of graphs. Nevertheless, trees have been used a long time before the foundation of the graph theory. An example is the notion of a genealogical tree. The area of family relationships was an origin of some terminology in the area of the tree theory (parent, child, sibling, ...) in addition to the terms originating from the area of the dendrology (root, branch, leaf, ...).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Prentice-Hall, Englewood Cliffs (1972)Google Scholar
  2. 2.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) STOC, pp. 202–211. ACM, New York (2004)CrossRefGoogle Scholar
  3. 3.
    Arbology: www pages (2010), http://www.arbology.org/
  4. 4.
    Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (Release October 12, 2007), http://www.grappa.univ-lille3.fr/tata
  5. 5.
    Flouri, T., Janoušek, J., Melichar, B.: Subtree matching by pushdown automata. Computer Science and Information Systems, ComSIS Consortium (To appear 2010)Google Scholar
  6. 6.
    Gecseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 1–68. Springer, Berlin (1997) (Beyond Words)Google Scholar
  7. 7.
    Hoffmann, C.M., O’Donnell, M.J.: Pattern matching in trees. J. ACM 29(1), 68–95 (1982)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Janoušek, J.: String suffix automata and subtree pushdown automata. In: Holub, J., Žďáreks, J. (eds.) Proceedings of the Prague Stringology Conference 2009, pp. 160–172. Czech Technical University, Prague (2009), http://www.stringology.org/event/2009 Google Scholar
  9. 9.
    Janoušek, J., Melichar, B.: On regular tree languages and deterministic pushdown automata. Acta Inf. 46(7), 533–547 (2009)MATHCrossRefGoogle Scholar
  10. 10.
    Janoušek, J., Melichar, B.: Subtree and tree pattern pushdown automata for trees in prefix notation. Submitted for publication (2009)Google Scholar
  11. 11.
    Janoušek, J., Melichar, B.: Finding repeats of subtrees in a tree using pushdown automata (in preparation, 2010)Google Scholar
  12. 12.
    Melichar, B.: Repetitions in text and finite automata. In: Cleophas, I.L., Watson, B.W. (eds.) Proceedings of the Eindhoven FASTAR Days 2004. TU Eindhoven, The Netherlands, pp. 1–46 (2004)Google Scholar
  13. 13.
    Melichar, B., Holub, J., Polcar, J.: Text searching algorithms, http://stringology.org/athens/ (release November 2005)
  14. 14.
    Nowotka, D., Srba, J.: Height-deterministic pushdown automata. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 125–134. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Bořivoj Melichar
    • 1
  1. 1.Department of Theoretical Computer Science, Faculty of Information TechnologyCzech Technical University in PraguePrague 6Czech Republic

Personalised recommendations