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...

Full description

Saved in:
Bibliographic Details
Published in2009 International Multiconference on Computer Science and Information Technology pp. 659 - 666
Main Authors Flouri, Tomas, Melichar, Borivoj, Janousek, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2009
Subjects
Automata
Computational modeling
Computer languages
Computer science
Counting circuits
Formal languages
Helium
Information technology
Pattern matching
Personal digital assistants
Online AccessGet full text
ISBN9781424453146
1424453143
ISSN2157-5525
DOI10.1109/IMCSIT.2009.5352769

Cover

More Information
Summary: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