@inproceedings{4ef9759c921b4ed5b06ba3c4b039d826,

title = "A Normalized Edit Distance on Infinite Words",

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{\"u}chi automata.",

keywords = "Edit Distance, Infinite Words, Robustness",

author = "Dana Fisman and Joshua Grogin and Gera Weiss",

note = "Funding Information: This work was supported in part by ISF grants 2714/19 and 2507/21. Publisher Copyright: {\textcopyright} Dana Fisman, Joshua Grogin, and Gera Weiss; licensed under Creative Commons License CC-BY 4.0.; 31st EACSL Annual Conference on Computer Science Logic, CSL 2023 ; Conference date: 13-02-2023 Through 16-02-2023",

year = "2023",

month = feb,

day = "1",

doi = "10.4230/LIPIcs.CSL.2023.20",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Bartek Klin and Elaine Pimentel",

booktitle = "31st EACSL Annual Conference on Computer Science Logic, CSL 2023",

address = "Germany",

}