Biinfinite words with maximal recurrent unbordered factors.
From MaRDI portal
Publication:1401214
DOI10.1016/S0304-3975(02)00372-9zbMath1046.68085MaRDI QIDQ1401214
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Automatic Theorem-Proving in Combinatorics on Words ⋮ The Overlap Gap Between Left-Infinite and Right-Infinite Words ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ Border correlation of binary words ⋮ On the number of frames in binary words ⋮ INVOLUTIVELY BORDERED WORDS ⋮ A characterization of periodicity of bi-infinite words
Cites Work
- Unnamed Item
- Periodicity and unbordered segments of words
- Relationship between the period of a finite word and the length of its unbordered segments
- Une caractérisation des mots périodiques
- Characterizations of locally testable events
- Algebraic decision procedures for local testability
- Free profinite locally idempotent and locally commutative semigroups
