Pages that link to "Item:Q1137038"
From MaRDI portal
The following pages link to Avoidable patterns in strings of symbols (Q1137038):
Displaying 50 items.
- Avoidability index for binary patterns with reversal (Q252854) (← links)
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- On the avoidability index of palindromes (Q351673) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Thue choosability of trees (Q411845) (← links)
- Square-free shuffles of words (Q496046) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- Power semigroups of finite groups and the INFB property. (Q607456) (← links)
- Pattern systems (Q672745) (← links)
- A new solution for Thue's problem (Q673665) (← links)
- Multi-pattern languages (Q673787) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- Infinite arrays and controlled deterministic table 0L array systems (Q797993) (← links)
- On the centers of the set of weakly square-free words on a two letter alphabet (Q800095) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- Many aspects of formal languages (Q805241) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Nonrepetitive colorings of trees (Q864157) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Some results in square-free and strong square-free edge-colorings of graphs (Q879399) (← links)
- On the algorithmic decidability of the square-free word problem relative to a system of two defining relations (Q893718) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Polynomial growth in semigroup varieties. (Q952539) (← links)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- The entropy of square-free words (Q967942) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- On the size of the alphabet and the subword complexity of square-free DOL languages (Q1050120) (← links)
- On the product of square-free words (Q1060021) (← links)
- A characterization of power-free morphisms (Q1062467) (← links)
- Unsolvability of problems of equality and divisibility in certain varieties of semigroups (Q1065939) (← links)
- Repetition-free words (Q1078338) (← links)
- Applications of an infinite square-free co-CFL (Q1088415) (← links)
- Long unavoidable patterns (Q1101241) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Avoidable patterns on two letters (Q1114419) (← links)
- On the generation of powers by OS schemes (Q1116709) (← links)
- Sequence avoiding any complete word (Q1123274) (← links)
- Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
- Infinite 0-1 sequences without long adjacent identical blocks (Q1132880) (← links)
