Fine and Wilf's theorem for three periods and a generalization of Sturmian words
From MaRDI portal
Publication:1292483
DOI10.1016/S0304-3975(98)00251-5zbMath0916.68114MaRDI QIDQ1292483
Filippo Mignosi, M. Gabriella Castelli, Antonio Restivo
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (31)
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS ⋮ Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester ⋮ On a generalization of Christoffel words: epichristoffel words ⋮ Episturmian words: a survey ⋮ String Periods in the Order-Preserving Model ⋮ Lyndon words and Fibonacci numbers ⋮ Palindromes in circular words ⋮ Periodicity, morphisms, and matrices. ⋮ Conjugacy and episturmian morphisms. ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Fine and Wilf words for any periods ⋮ On a paper by Castelli, Mignosi, Restivo ⋮ How many runs can a string contain? ⋮ Periodicity properties on partial words ⋮ Generalized pattern matching and periodicity under substring consistent equivalence relations ⋮ On an involution of Christoffel words and Sturmian morphisms ⋮ Generalised fine and Wilf's theorem for arbitrary number of periods ⋮ Fine and Wilf words for any periods. II ⋮ Episturmian morphisms and a Galois theorem on continued fractions ⋮ String periods in the order-preserving model ⋮ On \(\theta\)-episturmian words ⋮ Intersecting periodic words ⋮ Some algorithms to compute the conjugates of Episturmian morphisms ⋮ Imbalances in Arnoux-Rauzy sequences ⋮ FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS ⋮ MULTIPSEUDOPERIODIC WORDS ⋮ BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS ⋮ On graphs of central episturmian words ⋮ On multiperiodic words ⋮ Episturmian words and episturmian morphisms ⋮ A periodicity lemma for partial words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- Periods in strings
- Sturmian morphisms and Rauzy's rules
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Standard Sturmian morphisms
- Représentation géométrique de suites de complexité $2n+1$
- Multidimensional greatest common divisor and Lehmer algorithms
- Complexity of sequences defined by billiard in the cube
- Complexité de suites définies par des billards rationnels
- Uniqueness Theorems for Periodic Functions
- Algorithm and bound for the greatest common divisor of n integers
This page was built for publication: Fine and Wilf's theorem for three periods and a generalization of Sturmian words
