A trace partitioned Gray code for q-ary generalized Fibonacci strings
Combinatorics
2013-08-19 v1
Abstract
We provide a trace partitioned Gray code for the set of q-ary strings avoiding a pattern constituted by k consecutive equal symbols. The definition of this Gray code is based on two different constructions, according to the parity of q. This result generalizes, and is based on, a Gray code for binary strings avoiding k consecutive 0's.
Cite
@article{arxiv.1308.3619,
title = {A trace partitioned Gray code for q-ary generalized Fibonacci strings},
author = {Antonio Bernini and Stefano Bilotta and Renzo Pinzani and Vincent Vajnovszki},
journal= {arXiv preprint arXiv:1308.3619},
year = {2013}
}