Infinite families of 2-isometric and not 3-isometric binary words

DOI10.1016/J.TCS.2017.07.028zbMath1379.68268OpenAlexW2739944391MaRDI QIDQ2405889

Jianxin Wei, Guangfu Wang, Yujun Yang

Publication date: 28 September 2017

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

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

zbMATH Keywords

binary wordisometric word\(s\)-isometric wordnon-isometric word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

A characterization of non-isometric binary words ⋮ Proof of a conjecture on 2-isometric words ⋮ Circular embeddability of isometric words

Cites Work

• Unnamed Item
• 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
• Some operations preserving primitivity of words
• 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
• On median nature and enumerative properties of Fibonacci-like cubes
• Prefix Reversals on Binary and Ternary Strings
• Generalized fibonacci cubes are mostly hamiltonian

This page was built for publication: Infinite families of 2-isometric and not 3-isometric binary words