The P(n)/n-function for bi-finite words

DOI10.1016/S0304-3975(00)00432-1MaRDI QIDQ1605481zbMATH OpenFDO

Authors Alex Heinis

Publication date 18 July 2002

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• scientific article; zbMATH DE number 3440485 (Why is no real title available?)
• Intertwinings of periodic sequences
• On low-complexity bi-infinite words and their factors
• The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity

Cited in

(3)

• Hereditary properties of words
• An isolated point in the Heinis spectrum
• On the complexity function for sequences which are not uniformly recurrent

This page was built for publication: The \(P(n)/n\)-function for bi-finite words

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