A Normalized Edit Distance on Infinite Words

Dana Fisman, Joshua Grogin, Gera Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We introduce ω-ned, an edit distance between infinite words, that is a natural extension of ned, the normalized edit distance between finite words. We show it is a metric on (equivalence classes of) infinite words. We provide a polynomial time algorithm to compute the distance between two ultimately periodic words, and a polynomial time algorithm to compute the distance between two regular ω-languages given by non-deterministic Büchi automata.

Original languageEnglish
Title of host publication31st EACSL Annual Conference on Computer Science Logic, CSL 2023
EditorsBartek Klin, Elaine Pimentel
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772648
DOIs
StatePublished - 1 Feb 2023
Event31st EACSL Annual Conference on Computer Science Logic, CSL 2023 - Warsaw, Poland
Duration: 13 Feb 202316 Feb 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume252
ISSN (Print)1868-8969

Conference

Conference31st EACSL Annual Conference on Computer Science Logic, CSL 2023
Country/TerritoryPoland
CityWarsaw
Period13/02/2316/02/23

Keywords

  • Edit Distance
  • Infinite Words
  • Robustness

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'A Normalized Edit Distance on Infinite Words'. Together they form a unique fingerprint.

Cite this