A Set Automaton to Locate All Pattern Matches in a Term

Term pattern matching is the problem of finding all pattern matches in a subject term, given a set of patterns. Finding efficient algorithms for this problem is an important direction for research [19]. We present a new set automaton solution for the term pattern matching problem that is based on ma...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Erkens, Rick, Groote, Jan Friso
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Formal Languages and Automata Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!