Fine and Wilf words for any periods

DOI10.1016/S0019-3577(03)90076-0zbMath1091.68088MaRDI QIDQ1433188

Luca Q. Zamboni, Robert Tijdeman

Publication date: 15 June 2004

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (19)

Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester ⋮ On the number of partitions of an integer in the \(m\)-bonacci base ⋮ On a special class of primitive words ⋮ String Periods in the Order-Preserving Model ⋮ Extremal values of semi‐regular continuants and codings of interval exchange transformations ⋮ Critical exponents of infinite balanced words ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Periodicity properties on partial words ⋮ On Schweiger's problems on fully subtractive algorithms ⋮ Maximal continuants and the Fine-Wilf theorem ⋮ Generalised fine and Wilf's theorem for arbitrary number of periods ⋮ Fine and Wilf words for any periods. II ⋮ A palindromization map on free monoids ⋮ String periods in the order-preserving model ⋮ On \(\theta\)-episturmian words ⋮ MULTIPSEUDOPERIODIC WORDS ⋮ On graphs of central episturmian words ⋮ On multiperiodic words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intertwinings of periodic sequences
• Fine and Wilf's theorem for three periods and a generalization of Sturmian words
• Some combinatorial properties of Sturmian words
• On Fine and Wilf's theorem for bidimensional words.
• On a paper by Castelli, Mignosi, Restivo
• Représentation géométrique de suites de complexité $2n+1$
• Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
• Ergodic properties of a dynamical system arising from percolation theory
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Fine and Wilf words for any periods