Approximate Membership for Regular Languages modulo the Edit Distance - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2013

Approximate Membership for Regular Languages modulo the Edit Distance

Antoine Mbaye Ndione
  • Function : Author
  • PersonId : 919663
Aurélien Lemay
  • Function : Author
  • PersonId : 834816
Joachim Niehren

Abstract

We present a probabilistic algorithm for testing approximate membership of words to regular languages modulo the edit distance. The time complexity of our algorithm, which is independent of the size of the input word, is polynomial in the size of the input automaton and the inverse error precision. All previous property testing algorithms for regular languages, whether they consider approximations modulo the Hamming distance or the edit distance with moves, run in exponential time if not fixing one of these parameters.
Fichier principal
Vignette du fichier
0.pdf (428.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00801970 , version 1 (18-03-2013)

Identifiers

Cite

Antoine Mbaye Ndione, Aurélien Lemay, Joachim Niehren. Approximate Membership for Regular Languages modulo the Edit Distance. Theoretical Computer Science, 2013, 487, pp.37-49. ⟨10.1016/j.tcs.2013.03.004⟩. ⟨hal-00801970⟩
266 View
222 Download

Altmetric

Share

Gmail Facebook X LinkedIn More