Local periods and binary partial words: an algorithm

DOI10.1016/j.tcs.2003.11.025zbMath1070.68061OpenAlexW1988104433MaRDI QIDQ1884922

Ajay Chriscoe, Francine Blanchet-Sadri

Publication date: 27 October 2004

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

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

zbMATH Keywords

PeriodsWordsLocal periodsPartial words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (13)

Testing primitivity on partial words ⋮ Border correlations, lattices, and the subgraph component polynomial ⋮ An algorithmic toolbox for periodic partial words ⋮ Partial words and the critical factorization theorem revisited ⋮ Equations on partial words ⋮ Relational codes of words ⋮ Periodicity properties on partial words ⋮ Defect theorems with compatibility relations. ⋮ Primitive partial words ⋮ Codes, orderings, and partial words ⋮ Partial words and the critical factorization theorem ⋮ Combinatorics on partial word correlations ⋮ The theorem of Fine and Wilf for relational periods

Cites Work

• Unnamed Item
• Unnamed Item
• A periodicity result of partial words with one hole
• Periods in strings
• On the combinatorics of finite words
• Partial words and a theorem of Fine and Wilf
• Periodicity on partial words
• Conjugacy on partial words.
• Periods and binary words
• Uniqueness Theorems for Periodic Functions
• Partial words and a theorem of Fine and Wilf revisited

This page was built for publication: Local periods and binary partial words: an algorithm