The factor automaton
2002
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
1
References
2
Citations
NaN
KQI