Solution to a conjecture on words that are bad and 2-isometric
From MaRDI portal
(Redirected from Publication:476867)
Recommendations
- Proof of a conjecture on 2-isometric words
- On a conjecture on bidimensional words.
- On \(k\)-ary \(n\)-cubes and isometric words
- A characterization of non-isometric binary words
- Circular embeddability of isometric words
- Infinite families of 2-isometric and not 3-isometric binary words
- On periodicity of two-dimensional words
- On the least number of palindromes in two-dimensional words
- A stronger square conjecture on binary words
- scientific article; zbMATH DE number 3877434
Cites work
- scientific article; zbMATH DE number 1157214 (Why is no real title available?)
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- Generalized fibonacci cubes are mostly hamiltonian
- Prefix Reversals on Binary and Ternary Strings
- Some operations preserving primitivity of words
- Structure of Fibonacci cubes: a survey
- The index of a binary word
Cited in
(12)- Proof of a conjecture on 2-isometric words
- Cube-complements of generalized Fibonacci cubes
- Infinite families of 2-isometric and not 3-isometric binary words
- A characterization of non-isometric binary words
- A negative answer to a problem on generalized Fibonacci cubes
- The self-concatenation of isometric strings is isometric
- All good (bad) words consisting of 5 blocks
- The structures of bad words
- Proofs of two conjectures on generalized Fibonacci cubes
- The index of a binary word
- Circular embeddability of isometric words
- On isomorphism classes of generalized Fibonacci cubes
This page was built for publication: Solution to a conjecture on words that are bad and 2-isometric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476867)
