Name
Abstract | ||
|---|---|---|
Based on order relations inspired by the binary reflected Gray code (BRGC) we define Gray codes and give 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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s00236-015-0225-2 | Acta Informatica |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Gray code,Mathematics,Binary number | Journal | abs/1404.0823 |
Issue | ISSN | Citations |
7-8 | 1432-0525 | 1 |
PageRank | References | Authors |
0.36 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Bernini | 1 | 34 | 7.68 |
| Stefano Bilotta | 2 | 32 | 9.62 |
| Renzo Pinzani | 3 | 341 | 67.45 |
| A. Sabri | 4 | 1 | 0.36 |
| Vincent Vajnovszki | 5 | 170 | 24.12 |