Geodesic
The factor automaton
Kybernetika, Tome 38 (2002) no. 1, p. [105].

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

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.
Classification : 68P05, 68Q45, 68W05
Keywords: searching algorithm; data structures; factor automaton 
@article{KYB_2002__38_1_a6,
     author = {\v{S}im\'anek, Milan},
     title = {The factor automaton},
     journal = {Kybernetika},
     pages = {[105]},
     publisher = {mathdoc},
     volume = {38},
     number = {1},
     year = {2002},
     mrnumber = {1899850},
     zbl = {1265.68092},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2002__38_1_a6/}
}
TY  - JOUR
AU  - Šimánek, Milan
TI  - The factor automaton
JO  - Kybernetika
PY  - 2002
SP  - [105]
VL  - 38
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_2002__38_1_a6/
LA  - en
ID  - KYB_2002__38_1_a6
ER  - 
%0 Journal Article
%A Šimánek, Milan
%T The factor automaton
%J Kybernetika
%D 2002
%P [105]
%V 38
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_2002__38_1_a6/
%G en
%F KYB_2002__38_1_a6
Šimánek, Milan. The factor automaton. Kybernetika, Tome 38 (2002) no. 1, p. [105]. http://geodesic.mathdoc.fr/item/KYB_2002__38_1_a6/