A new regular grammar pattern matching algorithm

This paper presents a Boyer–Moore type algorithm for regular grammar pattern matching, answering a variant of an open problem posed by Aho (Pattern Matching in Strings, Academic Press, New York, 1980, p. 342). The new algorithm handles patterns specified by regular (left linear) grammars—a generaliz...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2003-04, Vol.299 (1-3), p.509-521
1. Verfasser:	Watson, Bruce W.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Boyer–Moore algorithm Computer science control theory systems Data processing. List processing. Character string processing Exact sciences and technology Language theory and syntactical analysis Memory organisation. Data processing Pattern matching algorithms Pattern recognition. Digital image processing. Computational geometry Regular grammars Software Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!