Pages that link to "Item:Q1121031"
From MaRDI portal
The following pages link to Enumeration of irreducible binary words (Q1121031):
Displaying 25 items.
- Growth properties of power-free languages (Q465700) (← links)
- Relations on words (Q505060) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Binary words with a given Diophantine exponent (Q1034641) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- Overlap-free words and finite automata (Q1261466) (← links)
- A characterization of overlap-free morphisms (Q1308744) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- Lengths of irreducible and delicate words (Q2153402) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Recursive formula of enumeration on forbidden words (Q2423993) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Binomial coefficients and enumeration of restricted words (Q2830494) (← links)
- Enumeration of Rota-Baxter words (Q2958978) (← links)
- Comparing Complexity Functions of a Language and Its Extendable Part (Q3526422) (← links)
- Study of irreducible balanced pairs for substitutive languages (Q3537490) (← links)
- Reduction and irreducibility for words and tree-words (Q3755483) (← links)
- Infinite words containing squares at every position (Q5190080) (← links)
- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices (Q5458519) (← links)
- On the number of partially abelian square-free words on a three-letter alphabet (Q6390604) (← links)
- The first-order theory of binary overlap-free words is decidable (Q6622783) (← links)
