Indexing Trees by Pushdown Automata for Nonlinear Tree Pattern Matching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00184199" target="_blank" >RIV/68407700:21240/11:00184199 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?reload=true&punumber=6068195" target="_blank" >http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?reload=true&punumber=6068195</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Indexing Trees by Pushdown Automata for Nonlinear Tree Pattern Matching
Original language description
A new kind of an acyclic pushdown automaton for an ordered tree is presented. The nonlinear tree pattern pushdown automaton represents a complete index of the tree for nonlinear tree patterns and accepts all nonlinear tree patterns which match the tree.Given a tree with n nodes, the number of such nonlinear tree patterns is O((2+v)n), where v is the number of variables in the patterns. We discuss time and space complexities of the nondeterministic nonlinear tree pattern pushdown automaton and a way ofits implementation. The presented pushdown automaton is input-driven and therefore can be determinised.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
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
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů