Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

  • Tomáš Flouri
  • Jan Janoušek
  • Bořivoj Melichar
  • Costas S. Iliopoulos
  • Solon P. Pissis
Conference paper

DOI: 10.1007/978-3-642-22256-6_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6807)
Cite this paper as:
Flouri T., Janoušek J., Melichar B., Iliopoulos C.S., Pissis S.P. (2011) Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. In: Bouchou-Markhoff B., Caron P., Champarnaud JM., Maurel D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg

Abstract

We consider the problem of tree template matching in ranked ordered trees, and propose a solution based on the bottom-up technique. Specifically, we transform the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model. The method is analogous to the construction of string pattern matchers. The given tree template is preprocessed once, by constructing a nondeterministic pushdown automaton, which is then transformed to the equivalent deterministic one. Although we prove that the space required for preprocessing is exponential to the size of the tree template in the general case, the space required for a specific class of tree templates is linear. The time required for the searching phase is linear to the size of the subject tree in both cases.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tomáš Flouri
    • 1
  • Jan Janoušek
    • 1
  • Bořivoj Melichar
    • 1
  • Costas S. Iliopoulos
    • 2
    • 3
  • Solon P. Pissis
    • 2
  1. 1.Dept. of Theoretical Computer Science, Faculty of Information TechnologyCzech Technical University in PragueCzech Republic
  2. 2.Dept. of InformaticsKing’s College LondonLondonUK
  3. 3.DEBIICurtin University of TechnologyPerthAustralia

Personalised recommendations