Gray codes for \(A\)-free strings
From MaRDI portal
Publication:1918874
zbMath0849.94021MaRDI QIDQ1918874
Publication date: 21 July 1996
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118904
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
A trace partitioned Gray code forq-ary generalized Fibonacci strings ⋮ Gray codes for Fibonacci \(q\)-decreasing words ⋮ Gray codes for reflectable languages ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Combinatorial families that are exponentially far from being listable in Gray code sequence
This page was built for publication: Gray codes for \(A\)-free strings
