String matching based on finite automaton

From Algowiki

Revision as of 13:04, 1 October 2014 by Cuozzo (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Algorithmic problem: One-dimensional string matching

Type of algorithm:

Auxiliary data:

Abstract view

Induction basis

Induction step

Complexity

Further information

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=String_matching_based_on_finite_automaton&oldid=537"