Gray cycles of maximum length related to \(k\)-character substitutions
type: Item
instance of: scholarly article
title: Gray cycles of maximum length related to \(k\)-character substitutions
DOI: 10.1007/978-3-030-93489-7_12
author: J. Néraud
publication date: 2022-11-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2108.13659
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7614748
zbMATH Keywords: character
zbMATH Keywords: complexity
zbMATH Keywords: cycle
zbMATH Keywords: Gray
zbMATH Keywords: substitution
zbMATH Keywords: relation
zbMATH Keywords: word
MaRDI profile type: Publication
OpenAlex ID: W3197161245
cites work: ECO:a methodology for the enumeration of combinatorial objects
cites work: Prefix partitioned Gray codes for particular cross-bifix-free sets
cites work: Universal cycles for combinatorial structures
cites work: Affine m-ary gray codes
cites work: Q3910579
cites work: An algorithm for generating subsets of fixed size with a strong minimal change property
cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
cites work: On Generating the N-ary Reflected Gray Codes
cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences
cites work: Combinatorial Gray Codes
cites work: Q4714446
cites work: A Gray code for set partitions
cites work: Q4681162
cites work: Q5519904
cites work: Variable-length codes independent or closed with respect to edit relations
cites work: Data compression and Gray-code sorting
cites work: Generating necklaces
cites work: A Survey of Combinatorial Gray Codes
description: scientific article; zbMATH DE number 7614748