Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

The factor automaton

Milan Šimánek — 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.

Page 1

Download Results (CSV)