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