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

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

zbMATH Keywords

periodsimilarity relationpartial wordsubword complexityrelational period

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
• Partial words and a theorem of Fine and Wilf
• Interaction properties of relational periods
• Compatibility relations on codes and free monoids
• The theorem of Fine and Wilf for relational periods

Cited In (6)

• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• Recurrence in infinite partial words
• Interaction properties of relational periods
• Revisiting the relationship between compositional sequence complexity and periodicity
• 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)