2014/04/03 by Antonio Bernini, A. Bernini, Stefano Bilotta +11
Computer Science · Mathematics · #Algorithms and Data Compression #Coding theory and cryptography #cs.DM #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1404.0823
arxiv created 2014/04/05 · arxiv updated 2014/04/08
Based on BRGC inspired order relations we give Gray codes and a generating algorithm for q-ary words avoiding a prescribed factor. These generalize an early 2001 result and a very recent one published by some of the present authors, and can be seen as an alternative to those of Squire published in 1996. Among the involved tools, we make use of generalized BRGC order relations, ultimate periodicity of infinite words, and word matching techniques.