The factor automaton

Milan Šimánek

Kybernetika (2002)

  • Volume: 38, Issue: 1, page [105]-111
  • ISSN: 0023-5954

Abstract

top
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.

How to cite

top

Šimánek, Milan. "The factor automaton." Kybernetika 38.1 (2002): [105]-111. <http://eudml.org/doc/33570>.

@article{Šimánek2002,
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.},
author = {Šimánek, Milan},
journal = {Kybernetika},
keywords = {searching algorithm; data structures; factor automaton; searching algorithm; data structures; factor automaton},
language = {eng},
number = {1},
pages = {[105]-111},
publisher = {Institute of Information Theory and Automation AS CR},
title = {The factor automaton},
url = {http://eudml.org/doc/33570},
volume = {38},
year = {2002},
}

TY - JOUR
AU - Šimánek, Milan
TI - The factor automaton
JO - Kybernetika
PY - 2002
PB - Institute of Information Theory and Automation AS CR
VL - 38
IS - 1
SP - [105]
EP - 111
AB - 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.
LA - eng
KW - searching algorithm; data structures; factor automaton; searching algorithm; data structures; factor automaton
UR - http://eudml.org/doc/33570
ER -

References

top
  1. Crochemore M., Rytter W., Text Algorithms, Chapter 6, Subword graphs, Oxford University Press, Oxford 1994 MR1307378
  2. Melichar B., The construction of factor automata, In: Workshop’98, vol. 1, Czech Technical University, Prague 1997, pp. 189–190 (1997) 
  3. Šimánek M., Operations on factor automaton, In: Workshop ’98, vol. 1, Czech Technical University, Prague 1997, pp. 207–208 (1997) 
  4. Šimánek M., The factor automaton, In: Proceedings of the Prague Stringology Club Workshop’98, Czech Technical University Prague, 1998, pp. 102–106 (1998) 
  5. Šimánek M., Operations on Factor Automata, Postgraduate Study Report DC-PSR-98-02, Czech Technical University Prague 1998, 38 pp (1998) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.