Subtree matching by deterministic pushdown automata

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 non-procedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by determinis...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 International Multiconference on Computer Science and Information Technology s. 659 - 666
Hlavní autoři: Flouri, Tomas, Melichar, Borivoj, Janousek, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2009
Témata:
Automata
Computational modeling
Computer languages
Computer science
Counting circuits
Formal languages
Helium
Information technology
Pattern matching
Personal digital assistants
ISBN:9781424453146, 1424453143
ISSN:2157-5525
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 non-procedural 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.
ISBN:9781424453146
1424453143
ISSN:2157-5525
DOI:10.1109/IMCSIT.2009.5352769