Generalised fine and Wilf's theorem for arbitrary number of periods

DOI10.1016/j.tcs.2005.01.007zbMath1127.68074OpenAlexW1967306786MaRDI QIDQ557915

Lucian Ilie, Sorin Constantinescu

Publication date: 30 June 2005

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

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

zbMATH Keywords

periodscombinatorics on wordsFine and Wilf's theorem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

On a special class of primitive words ⋮ Periods in partial words: an algorithm ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Periodicity properties on partial words ⋮ Fine and Wilf words for any periods. II ⋮ On a Special Class of Primitive Words ⋮ FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS ⋮ MULTIPSEUDOPERIODIC WORDS ⋮ On multiperiodic words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fine and Wilf's theorem for three periods and a generalization of Sturmian words
• Partial words and a theorem of Fine and Wilf
• Periodicity, morphisms, and matrices.
• Fine and Wilf words for any periods
• On Fine and Wilf's theorem for bidimensional words.
• On a paper by Castelli, Mignosi, Restivo
• Uniqueness Theorems for Periodic Functions
• Partial words and a theorem of Fine and Wilf revisited

This page was built for publication: Generalised fine and Wilf's theorem for arbitrary number of periods