Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F10%3A00169122" target="_blank" >RIV/68407700:21240/10:00169122 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
Original language description
A new pushdown automata based algorithm for searching all occurrences of a tree pattern in a subject tree is presented. The algorithm allows pattern matching with don't care symbols and multiple patterns. A simulation algorithm is also proposed, and practical experimental results are presented.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2010
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
Article name in the collection
Proceedings of the Prague Stringology Conference 2010
ISBN
978-80-01-04597-8
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
České vysoké učení technické v Praze
Place of publication
Praha
Event location
Praha
Event date
Aug 30, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—