On Tree Pattern Matching by Pushdown Automata

Tree pattern matching is an important operation 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. Work has begun on a systematic approach to the construction of tree pattern m...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Acta polytechnica (Prague, Czech Republic : 1992) Jg. 49; H. 2
1. Verfasser: Flouri, T.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: CTU Central Library 01.01.2009
Schlagworte:
pushdown automaton
tree
tree pattern
tree pattern matching
ISSN:1210-2709, 1805-2363
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Tree pattern matching is an important operation 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. Work has begun on a systematic approach to the construction of tree pattern matchers by deterministic pushdown automata which read subject trees in prefix notation. The method is analogous to the construction of string pattern matchers: for given patterns, a non-deterministic pushdown automaton is created and then it is determinised. In this first paper, we present the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and prove its correctness. 
ISSN:1210-2709
1805-2363
DOI:10.14311/1113