Least Periods of Factors of Infinite Words
From MaRDI portal
Publication:3549293
DOI10.1051/ITA:2008006zbMATH Open1162.68510OpenAlexW2101596584MaRDI QIDQ3549293FDOQ3549293
Publication date: 22 December 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_1_165_0/
Recommendations
- Some results on the number of periodic factors in words
- Quasiperiods of infinite words
- Reasoning about periodicity on infinite words
- scientific article; zbMATH DE number 1408358
- Viennot factorization of infinite words
- Determining sets of quasiperiods of infinite words
- Lyndon factorization of infinite words
- Weak abelian periodicity of infinite words
- Weak abelian periodicity of infinite words
- Recurrence and periodicity in infinite words from local periods
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Powers in Sturmian sequences
- Dejean's conjecture and Sturmian words
- Some characterizations of finite Sturmian words.
- A Note on a Conjecture of Duval and Sturmian Words
- Some properties of the factors of Sturmian sequences.
- MINIMAL DUVAL EXTENSIONS
- Title not available (Why is that?)
Cited In (22)
- Lyndon words and Fibonacci numbers
- On the Number of Unbordered Factors
- Lyndon factorization of infinite words
- Abelian periods of factors of Sturmian words
- Enumeration of factors in the Thue-Morse word
- Asymptotic analysis of \(q\)-recursive sequences
- Say no to case analysis: automating the drudgery of case-based proofs
- Abelian powers and repetitions in Sturmian words
- On the number of frames in binary words
- Decidability for Sturmian words
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- An Inequality for the Number of Periods in a Word
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
- Automatic Theorem-Proving in Combinatorics on Words
- Standard factors of Sturmian words
- Critical exponents of infinite balanced words
- Searching for Zimin patterns
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
- Avoiding letter patterns in ternary square-free words
- Title not available (Why is that?)
- Abelian combinatorics on words: a survey
This page was built for publication: Least Periods of Factors of Infinite Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549293)
