BACK to VOLUME 38 NO.1

Kybernetika 38(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.


AMS: 68Q;


download full-text.pdf
download abstract.pdf

BIB TeX

@article{kyb:2002:1:105-111,

author = {\v{S}im\'{a}nek, Milan},

title = {The Factor Automaton.},

journal = {Kybernetika},

volume = {38},

year = {2002},

number = {1},

pages = {105-111}

publisher = {{\'U}TIA, AV {\v C}R, Prague },

}


BACK to VOLUME 38 NO.1