Solution to a conjecture on words that are bad and 2-isometric

DOI10.1016/j.tcs.2014.10.001zbMath1303.68100OpenAlexW2013692835WikidataQ123134698 ScholiaQ123134698MaRDI QIDQ476867

Jianxin Wei, Heping Zhang

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.001

zbMATH Keywords

\(s\)-isometricbad wordgeneralized Fibonacci cubegood word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

A negative answer to a problem on generalized Fibonacci cubes ⋮ 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 ⋮ A characterization of non-isometric binary words ⋮ Proof of a conjecture on 2-isometric words ⋮ Cube-complements of generalized Fibonacci cubes ⋮ On isomorphism classes of generalized Fibonacci cubes ⋮ Proofs of two conjectures on generalized Fibonacci cubes ⋮ Circular embeddability of isometric words

Cites Work

• Unnamed Item
• Asymptotic number of isometric generalized Fibonacci cubes
• Generalized Fibonacci cubes
• The index of a binary word
• 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: Solution to a conjecture on words that are bad and 2-isometric