2726. A problem on strings of beads
From MaRDI portal
Publication:3246337
DOI10.2307/3610126zbMath0079.01101OpenAlexW4206578473MaRDI QIDQ3246337
Publication date: 1957
Published in: The Mathematical Gazette (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3610126
Related Items (18)
Repetition-free words ⋮ Multidimensional unrepetitive configurations ⋮ The complexity of unavoidable word patterns ⋮ A generalized variety problem ⋮ On \(k\)-abelian avoidability ⋮ Mots sans carre et morphismes iterés ⋮ Square-free words obtained from prefixes by permutations ⋮ Cancellation in semigroups in which \(x^ 2=x^ 3\) ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ Direct definition of a ternary infinite square-free sequence ⋮ Square-free partial words ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ Detecting patterns in finite regular and context-free languages ⋮ On two-sided infinite fixed points of morphisms ⋮ Sur un théorème de Thue ⋮ Algebras of Finite Global Dimension ⋮ Computing the Tandem Duplication Distance is NP-Hard ⋮ The tandem duplication distance problem is hard over bounded alphabets
This page was built for publication: 2726. A problem on strings of beads
