Kybernetika 38 no. 1, 105-111, 2002

The factor automaton

Milan Šimánek

Abstract:

This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.