Sublinear Matching With Finite Automata Using Reverse Suffix Scanning

We give algorithms to accelerate the computation of deterministic finite automata (DFA) by calculating the state of a DFA n positions ahead utilizing a reverse scan of the next n characters. Often this requires scanning fewer than n characters resulting in a fraction of the input being skipped and a...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Kearns, Steven M
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!