A characterization of periodicity of bi-infinite words

DOI10.1016/J.TCS.2004.08.017zbMATH Open1080.68088OpenAlexW2090165965MaRDI QIDQ2576886

A. Lepistö, Dirk Nowotka, Tero Harju

Publication date: 29 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.017

zbMATH Keywords

periodicitybi-infinite wordscombinatorics on wordsunbordered factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Biinfinite words with maximal recurrent unbordered factors.
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (4)

A characterization of binary morphisms generating Lyndon infinite words ⋮ A Characterization of Bispecial Sturmian Words ⋮ Construction of a bi-infinite power free word with a given factor and a non-recurrent letter ⋮ On low-complexity bi-infinite words and their factors

This page was built for publication: A characterization of periodicity of bi-infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576886)