Pages that link to "Item:Q2653273"
From MaRDI portal
The following pages link to Unending chess, symbolic dynamics and a problem in semi-groups (Q2653273):
Displayed 50 items.
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words (Q466028) (← links)
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism (Q580507) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- A new solution for Thue's problem (Q673665) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- On the Burnside problem for semigroups (Q797705) (← 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)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Functionally recursive rings of matrices -- two examples (Q848527) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- Non-repetitive words relative to a rewriting system (Q908710) (← links)
- Cancellation in semigroups in which \(x^ 2=x^ 3\) (Q909798) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Sequences generated by infinitely iterated morphisms (Q1070044) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- Enumeration of irreducible binary words (Q1121031) (← links)
- Infinite 0-1 sequences without long adjacent identical blocks (Q1132880) (← links)
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- The Morse sequence and iterated morphisms (Q1154288) (← links)
- The Burnside problem for semigroups (Q1215588) (← links)
- Bounded AFLs (Q1227455) (← links)
- Overlap-free words and finite automata (Q1261466) (← links)
- A characterization of overlap-free morphisms (Q1308744) (← links)
- Tiling and local rank properties of the Morse sequence (Q1329736) (← links)
- Every finite semigroup is embeddable in a finite relatively free semigroup. (Q1421247) (← links)
- Finite semigroups whose varieties have uncountably many subvarieties (Q1570360) (← links)
- Notions of denseness (Q1586948) (← links)
- A separation between RLSLPs and LZ77 (Q1632509) (← links)
- On square-free arithmetic progressions in infinite words (Q1740699) (← links)
- On the factors of the Thue-Morse word on three symbols (Q1813107) (← links)
- Enumeration of factors in the Thue-Morse word (Q1824700) (← links)
- On some bounded semiAFLs and AFLs (Q1837538) (← links)
- Generation of symmetric exponential sums (Q1881324) (← links)
- The combinatorial degrees of proofs and equations (Q1918969) (← links)
- Binary words avoided by the Thue-Morse sequence (Q1924519) (← links)
- Limit varieties of \(J\)-trivial monoids (Q2037094) (← links)
- The lattice of varieties of monoids (Q2105481) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- Locally testable semigroups (Q2264860) (← links)
- Chains and fixing blocks in irreducible binary sequences (Q2266018) (← links)
- Some further results on squarefree arithmetic progressions in infinite words (Q2333815) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- Sur un théorème de Thue (Q2555163) (← links)
- Inequalities characterizing standard Sturmian and episturmian words (Q2566013) (← links)
- Which graphs allow infinite nonrepetitive walks? (Q2639070) (← links)
- Squarefree words with interior disposable factors (Q2658049) (← links)