Relationally Periodic Sequences and Subword Complexity

DOI10.1007/978-3-540-85780-8_15zbMATH Open1159.68029OpenAlexW1504594137MaRDI QIDQ3533010FDOQ3533010

Authors Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni

Publication date 30 October 2008

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85780-8_15

zbMATH Keywords

periodsimilarity relationpartial wordsubword complexityrelational period

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The theorem of Fine and Wilf for relational periods
• On the periodicity of morphic words
• Cyclic Complexity of Words
• A new complexity function for words based on periodicity
• Interaction properties of relational periods

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Algorithmic combinatorics on partial words
• Compatibility relations on codes and free monoids
• Interaction properties of relational periods
• Partial words and a theorem of Fine and Wilf
• The theorem of Fine and Wilf for relational periods

Cited in

(7)

• Interaction properties of relational periods
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• Recurrence in infinite partial words
• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• Revisiting the relationship between compositional sequence complexity and periodicity
• The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
• Subword complexity and periodicity in two or more dimensions

This page was built for publication: Relationally Periodic Sequences and Subword Complexity

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