Gray cycles of maximum length related to k-character substitutions

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

Authors: J. Néraud 

Publication date: 9 November 2022

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

zbMATH Keywords

complexitysubstitutioncyclerelationcharacterwordGray

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096591)