We present a framework to generalize the standard b-ary Gray code to get the k-bonacci ones obtained in [5] as well as many others by using theoretical tools that allow to make calculations on lists. We introduce the notion of Z-Gray product, from which we deduce sequences of lists of finite words avoiding a predefinite list Z of factors and which satisfy a power-associativity property as well a generalizations of the classical flipping digit property.

翻译：我们提出一个框架，用以推广标准b进制格雷码，从而得到[5]中获得的k-bonacci格雷码及其他众多变体。该框架借助理论工具实现对列表上的计算操作。我们引入Z-格雷积的概念，由此推导出满足幂结合性及经典翻转数字性质推广的、避免预定义因子列表Z的有限单词列表序列。