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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2009 International Multiconference on Computer Science and Information Technology S. 659 - 666
Hauptverfasser:	Flouri, Tomas, Melichar, Borivoj, Janousek, J.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.10.2009
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!