Skip to Main content Skip to Navigation
New interface
Conference papers

On the suffix automaton with mismatches

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Monday, October 3, 2016 - 6:48:34 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Friday, February 3, 2017 - 3:14:43 PM


Files produced by the author(s)




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⟩



Record views


Files downloads