Gray cycles of maximum length related to \(k\)-character substitutions

DOI10.1007/978-3-030-93489-7_12OpenAlexW3197161245MaRDI QIDQ2096591

Jean Néraud

Publication date: 9 November 2022

Full work available at URL: https://arxiv.org/abs/2108.13659

zbMATH Keywords

complexitycyclecharacterrelationsubstitutionwordGray

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prefix partitioned Gray codes for particular cross-bifix-free sets
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Data compression and Gray-code sorting
• Universal cycles for combinatorial structures
• A Gray code for set partitions
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Variable-length codes independent or closed with respect to edit relations
• On Generating the N-ary Reflected Gray Codes
• Combinatorial Gray Codes
• Generating necklaces
• A Survey of Combinatorial Gray Codes
• ECO:a methodology for the enumeration of combinatorial objects
• Affine m-ary gray codes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Gray cycles of maximum length related to \(k\)-character substitutions