Proof of a conjecture on 2-isometric words
From MaRDI portal
Publication:2220880
DOI10.1016/j.tcs.2020.11.026zbMath1477.68258OpenAlexW3110620048WikidataQ113863204 ScholiaQ113863204MaRDI QIDQ2220880
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.026
Related Items (2)
Hypercubes and isometric words based on swap and mismatch distance ⋮ On \(k\)-ary \(n\)-cubes and isometric words
Cites Work
- Unnamed Item
- Unnamed Item
- The structures of bad words
- Parity index of binary words and powers of prime words
- Solution to a conjecture on words that are bad and 2-isometric
- On isomorphism classes of generalized Fibonacci cubes
- Proofs of two conjectures on generalized Fibonacci cubes
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- The index of a binary word
- Structure of Fibonacci cubes: a survey
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- 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
- Infinite families of 2-isometric and not 3-isometric binary words
- A characterization of non-isometric binary words
- Generalized fibonacci cubes are mostly hamiltonian
This page was built for publication: Proof of a conjecture on 2-isometric words