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-5zbMATH Open0916.68114MaRDI QIDQ1292483FDOQ1292483
Authors: M. G. Castelli, Filippo Mignosi, Antonio Restivo 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Fine and Wilf's theorem for partial words with arbitrarily many weak periods
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Partial words and a theorem of Fine and Wilf revisited
- Special factors, periodicity, and an application to Sturmian words
- Sturm numbers and substitution invariance of 3iet words
- Quasiperiodic Sturmian words and morphisms
- Partial words and a theorem of Fine and Wilf
- scientific article; zbMATH DE number 1456957
- A periodicity theorem on words and applications
- On Fine and Wilf's theorem for bidimensional words.
Cites Work
- Title not available (Why is that?)
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Title not available (Why is that?)
- Représentation géométrique de suites de complexité $2n+1$
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Some combinatorial properties of Sturmian words
- Title not available (Why is that?)
- Algorithm and bound for the greatest common divisor of n integers
- Complexity of sequences defined by billiard in the cube
- Sturmian morphisms and Rauzy's rules
- Standard Sturmian morphisms
- Periods in strings
- Complexité de suites définies par des billards rationnels
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- Title not available (Why is that?)
- Multidimensional greatest common divisor and Lehmer algorithms
Cited In (35)
- Lyndon words and Fibonacci numbers
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- Some generalizations of periodic words
- Palindromes in circular words
- Fine and Wilf's theorem for \(k\)-abelian periods
- How many runs can a string contain?
- String Periods in the Order-Preserving Model
- Balance properties of Arnoux-Rauzy words
- On a generalization of Christoffel words: epichristoffel words
- Episturmian words and episturmian morphisms
- Episturmian morphisms and a Galois theorem on continued fractions
- Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
- Generalised fine and Wilf's theorem for arbitrary number of periods
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Three distance theorems and Sturmian sequences: length governing words
- On a paper by Castelli, Mignosi, Restivo
- Conjugacy and episturmian morphisms.
- Fine and Wilf words for any periods. II
- Periodicity, morphisms, and matrices.
- Fine and Wilf words for any periods
- On an involution of Christoffel words and Sturmian morphisms
- On graphs of central episturmian words
- Imbalances in Arnoux-Rauzy sequences
- Intersecting periodic words
- String periods in the order-preserving model
- Sturm numbers and substitution invariance of 3iet words
- On \(\theta\)-episturmian words
- Periodicity properties on partial words
- A periodicity lemma for partial words
- On multiperiodic words
- Obstructions to return preservation for episturmian morphisms
- Some algorithms to compute the conjugates of Episturmian morphisms
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Multipseudoperiodic words
- Episturmian words: a survey
This page was built for publication: Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292483)
