Subtree Matching by Deterministic Pushdown Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00159738" target="_blank" >RIV/68407700:21230/09:00159738 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/09:00159738
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Subtree Matching by Deterministic Pushdown Automata
Original language description
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix notation, is presented. The method is analogous to the construction of string pattern matchers: for a given pattern, a nondeterministic pushdown automaton is created and then it is determinised. In addition, it is shown that the size of the resulting deterministic pushdown automata directly corresponds to the size of the existing string pattern matchers based on finite automata.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

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

Article name in the collection
Proceedings of International Multiconference on Computer Science and Information Technology
ISBN
978-83-60810-22-4
ISSN
1896-7094
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
IEEE Computer Society Press
Place of publication
New York
Event location
Mragowo
Event date
Oct 12, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)