All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00191867" target="_blank" >RIV/68407700:21240/11:00191867 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.springerlink.com/content/x747k54j4v75/#section=927840&page=1&locus=0" target="_blank" >http://www.springerlink.com/content/x747k54j4v75/#section=927840&page=1&locus=0</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-22256-6" target="_blank" >10.1007/978-3-642-22256-6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Lecture Notes in Computer Science

  • ISSN

    0302-9743

  • e-ISSN

  • Volume of the periodical

    6807

  • Issue of the periodical within the volume

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    9

  • Pages from-to

    273-281

  • UT code for WoS article

  • EID of the result in the Scopus database