String-Matching with Finite Automata (Single String Search String Search)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O(m)$ words

(Derived: $O(m)$ states in the DFA)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=String-Matching_with_Finite_Automata_(Single_String_Search_String_Search)&oldid=45237"