Relationally Periodic Sequences and Subword Complexity

DOI10.1007/978-3-540-85780-8_15zbMath1159.68029OpenAlexW1504594137MaRDI QIDQ3533010

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

periodsubword complexitysimilarity relationpartial wordrelational period

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Recurrence in infinite partial words

Cites Work

• Unnamed Item
• Unnamed Item
• Partial words and a theorem of Fine and Wilf
• Compatibility relations on codes and free monoids
• The theorem of Fine and Wilf for relational periods
• ALGORITHMIC COMBINATORICS ON PARTIAL WORDS

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