| Title:
|
The factor automaton (English) |
| Author:
|
Šimánek, Milan |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
38 |
| Issue:
|
1 |
| Year:
|
2002 |
| Pages:
|
[105]-111 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
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. (English) |
| Keyword:
|
searching algorithm |
| Keyword:
|
data structures |
| Keyword:
|
factor automaton |
| MSC:
|
68P05 |
| MSC:
|
68Q45 |
| MSC:
|
68W05 |
| idZBL:
|
Zbl 1265.68092 |
| idMR:
|
MR1899850 |
| . |
| Date available:
|
2009-09-24T19:44:20Z |
| Last updated:
|
2015-03-24 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/135449 |
| . |
| Reference:
|
[1] Crochemore M., Rytter W.: Text Algorithms, Chapter 6, Subword graphs.Oxford University Press, Oxford 1994 MR 1307378 |
| Reference:
|
[3] Melichar B.: The construction of factor automata.In: Workshop’98, vol. 1, Czech Technical University, Prague 1997, pp. 189–190 |
| Reference:
|
[4] Šimánek M.: Operations on factor automaton.In: Workshop ’98, vol. 1, Czech Technical University, Prague 1997, pp. 207–208 |
| Reference:
|
[5] Šimánek M.: The factor automaton.In: Proceedings of the Prague Stringology Club Workshop’98, Czech Technical University Prague, 1998, pp. 102–106 |
| Reference:
|
[6] Šimánek M.: Operations on Factor Automata.Postgraduate Study Report DC-PSR-98-02, Czech Technical University Prague 1998, 38 pp |
| . |
