Geodesic
The finite automata approaches in stringology
Kybernetika, Tome 48 (2012) no. 3, pp. 386-401

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

We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
Classification : 62A10, 93E12
Keywords: exact pattern matching; approximate pattern matching; finite automata; dynamic programming; bitwise parallelism; suffix automaton; border array; degenerate symbol 
@article{KYB_2012__48_3_a3,
     author = {Holub, Jan},
     title = {The finite automata approaches in stringology},
     journal = {Kybernetika},
     pages = {386--401},
     publisher = {mathdoc},
     volume = {48},
     number = {3},
     year = {2012},
     mrnumber = {2975796},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2012__48_3_a3/}
}
TY  - JOUR
AU  - Holub, Jan
TI  - The finite automata approaches in stringology
JO  - Kybernetika
PY  - 2012
SP  - 386
EP  - 401
VL  - 48
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_2012__48_3_a3/
LA  - en
ID  - KYB_2012__48_3_a3
ER  - 
%0 Journal Article
%A Holub, Jan
%T The finite automata approaches in stringology
%J Kybernetika
%D 2012
%P 386-401
%V 48
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_2012__48_3_a3/
%G en
%F KYB_2012__48_3_a3
Holub, Jan. The finite automata approaches in stringology. Kybernetika, Tome 48 (2012) no. 3, pp. 386-401. http://geodesic.mathdoc.fr/item/KYB_2012__48_3_a3/