From Nerode’s congruence to suffix automata with mismatches

Alessandra Gabriele, Chiara Epifanio, Filippo Mignosi, Maxime Crochemore

Risultato della ricerca: Article

2 Citazioni (Scopus)

Abstract

In this paper we focus on the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. As first results we give a characterization of the Nerode''s right-invariant congruence that is associated with S_k. This result generalizes the classical characterization described in [5]. As second result we present an algorithm that makes use of S_k to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words. Finally, we state a conjecture and an open problem on the size and the construction of the suffix automaton with mismatches.
Lingua originaleEnglish
pagine (da-a)3471-3480
Numero di pagine10
RivistaTheoretical Computer Science
Volume410
Stato di pubblicazionePublished - 2009

Fingerprint

Suffix
Congruence
Automata
Deterministic Finite Automata
Finite automata
Prefix
Open Problems
Generalise
Invariant
Experimental Results
Text
Repetition
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cita questo

From Nerode’s congruence to suffix automata with mismatches. / Gabriele, Alessandra; Epifanio, Chiara; Mignosi, Filippo; Crochemore, Maxime.

In: Theoretical Computer Science, Vol. 410, 2009, pag. 3471-3480.

Risultato della ricerca: Article

@article{f03fffb0754f4b0a85a2b4e924759c16,
title = "From Nerode’s congruence to suffix automata with mismatches",
abstract = "In this paper we focus on the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. As first results we give a characterization of the Nerode''s right-invariant congruence that is associated with S_k. This result generalizes the classical characterization described in [5]. As second result we present an algorithm that makes use of S_k to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words. Finally, we state a conjecture and an open problem on the size and the construction of the suffix automaton with mismatches.",
keywords = "Combinatorics on words, Indexing, Suffix Automata, Languages with mismatches, Approximate string matching",
author = "Alessandra Gabriele and Chiara Epifanio and Filippo Mignosi and Maxime Crochemore",
year = "2009",
language = "English",
volume = "410",
pages = "3471--3480",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - From Nerode’s congruence to suffix automata with mismatches

AU - Gabriele, Alessandra

AU - Epifanio, Chiara

AU - Mignosi, Filippo

AU - Crochemore, Maxime

PY - 2009

Y1 - 2009

N2 - In this paper we focus on the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. As first results we give a characterization of the Nerode''s right-invariant congruence that is associated with S_k. This result generalizes the classical characterization described in [5]. As second result we present an algorithm that makes use of S_k to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words. Finally, we state a conjecture and an open problem on the size and the construction of the suffix automaton with mismatches.

AB - In this paper we focus on the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. As first results we give a characterization of the Nerode''s right-invariant congruence that is associated with S_k. This result generalizes the classical characterization described in [5]. As second result we present an algorithm that makes use of S_k to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words. Finally, we state a conjecture and an open problem on the size and the construction of the suffix automaton with mismatches.

KW - Combinatorics on words, Indexing, Suffix Automata, Languages with mismatches, Approximate string matching

UR - http://hdl.handle.net/10447/40047

M3 - Article

VL - 410

SP - 3471

EP - 3480

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -