Pages that link to "Item:Q3549293"
From MaRDI portal
The following pages link to Least Periods of Factors of Infinite Words (Q3549293):
Displaying 19 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- On the number of frames in binary words (Q719267) (← links)
- Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) (← links)
- Asymptotic analysis of \(q\)-recursive sequences (Q2165029) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- Critical exponents of infinite balanced words (Q2422043) (← links)
- Searching for Zimin patterns (Q2512657) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892) (← links)
- On the Number of Unbordered Factors (Q4910467) (← links)
- Standard factors of Sturmian words (Q5190084) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- An Inequality for the Number of Periods in a Word (Q6169892) (← links)
- Decidability for Sturmian words (Q6597962) (← links)
