The overlap gap between left-infinite and right-infinite words
J. C. Costa, C. Nogueira, M. L. Teixeira

TL;DR
This paper characterizes when the set of overlap gaps between left-infinite and right-infinite words is finite, showing it occurs precisely when both words are ultimately periodic with specific repeating structures.
Contribution
It provides a complete characterization of the conditions under which the overlap gap set is finite, linking it to the ultimate periodicity of the infinite words.
Findings
The overlap gap set is finite if and only if both words are ultimately periodic.
Ultimate periodicity involves words of the form $u^{- abla}w_1$ and $w_2 u^{ abla}$.
The result connects the structure of infinite words to the properties of their overlap gaps.
Abstract
Given two finite words and of equal length, define the \emph{overlap gap between and }, denoted , as the least integer for which there exist words and of length such that or . Informally, the overlap gap measures the outside parts of the greatest overlap of the given words. For a left-infinite word and a right-infinite word , let be the function defined, for each non-negative integer , by , where and are, respectively, the suffix of and the prefix of of length . Also, denote by the image of the function . In this paper, we show that is a finite set if and only if and are ultimately periodic infinite words of the form…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Natural Language Processing Techniques
