On the suffix automaton with mismatches - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

On the suffix automaton with mismatches


In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
Fichier principal
Vignette du fichier
07-CEGM-ciaa.pdf (191.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00620159 , version 1 (03-10-2016)



Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi. On the suffix automaton with mismatches. 12th International Conference on Implementation and Application of Automata (CIAA'07), 2007, Prague, Czech Republic. pp.144-156, ⟨10.1007/978-3-540-76336-9_15⟩. ⟨hal-00620159⟩
158 View
225 Download



Gmail Facebook X LinkedIn More