The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the complexity of events recognizable in real time”

The factor automaton

Milan Šimánek (2002)

Kybernetika

Similarity:

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.