Gray Cycles of Maximum Length Related to k-Character Substitutions

08/31/2021
by   Jean Néraud, et al.
0

Given a word binary relation τ we define a τ-Gray cycle over a finite language X to be a permutation w [i] 0≤i≤|X|–1 of X such that each word wi is an image of the previous word wi–1 by τ. In that framework, we introduce the complexity measure λ(n), equal to the largest cardinality of a language X having words of length at most n, and such that a τ-Gray cycle over X exists. The present paper is concerned with the relation τ = σ k , the so-called k-character substitution, where (u, v) belongs to σ k if, and only if, the Hamming distance of u and v is k. We compute the bound λ(n) for all cases of the alphabet cardinality and the argument n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/04/2023

Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution

Given a binary word relation τ onto A * and a finite language X ⊆ A * , ...
research
09/20/2023

Cardinality and Representation of Stone Relation Algebras

Previous work has axiomatised the cardinality operation in relation alge...
research
01/14/2019

The Complexity of Unavoidable Word Patterns

The avoidability, or unavoidability of patterns in words over finite alp...
research
01/18/2022

The maximum cardinality of trifferent codes with lengths 5 and 6

A code 𝒞⊆{0, 1, 2}^n is said to be trifferent with length n when for any...
research
12/18/2018

Computing the k-binomial complexity of the Thue--Morse word

Two words are k-binomially equivalent whenever they share the same subwo...
research
07/18/2021

Rotating Binaries

This paper investigates the behaviour of rotating binaries. A rotation b...
research
11/15/2016

The Role of Word Length in Semantic Topology

A topological argument is presented concering the structure of semantic ...

Please sign up or login with your details

Forgot password? Click here to reset