2 research outputs found
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution
Given a binary word relation onto and a finite language
, a -Gray cycle over consists in a permutation
of such that each word
is an image under of the previous word . We define the
complexity measure , equal to the largest cardinality of a
language having words of length at most , and s.t. some -Gray
cycle over exists. The present paper is concerned with , the
so-called -character substitution, s.t. holds if, and
only if, the Hamming distance of and is . We present loopless
(resp., constant amortized time) algorithms for computing specific maximum
length \sigma_k$-Gray cycles.Comment: arXiv admin note: text overlap with arXiv:2108.1365