The index of a binary word
From MaRDI portal
Publication:714791
DOI10.1016/j.tcs.2012.05.025zbMath1251.68173OpenAlexW2082223566MaRDI QIDQ714791
Sandi Klavžar, Aleksandar Ilić, Yoomi Rho
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.025
Related Items (16)
A negative answer to a problem on generalized Fibonacci cubes ⋮ Quaternary \(n\)-cubes and isometric words ⋮ The structures of bad words ⋮ 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 ⋮ Isometric words based on swap and mismatch distance ⋮ A characterization of non-isometric binary words ⋮ Hypercubes and isometric words based on swap and mismatch distance ⋮ Proof of a conjecture on 2-isometric words ⋮ Cube-complements of generalized Fibonacci cubes ⋮ 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 ⋮ Circular embeddability of isometric words ⋮ On \(k\)-ary \(n\)-cubes and isometric words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- Structure of Fibonacci cubes: a survey
- Some operations preserving primitivity of words
- Prefix Reversals on Binary and Ternary Strings
- Generalized fibonacci cubes are mostly hamiltonian
This page was built for publication: The index of a binary word