A Gray code for cross-bifix-free sets
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | A Gray code for cross-bifix-free sets |
| Type de publication | Journal Article |
| Year of Publication | 2017 |
| Auteurs | Bernini A, Bilotta S, Pinzani R, Vajnovszki V |
| Journal | MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE |
| Volume | 27 |
| Pagination | 184-196 |
| Date Published | FEB |
| Type of Article | Article; Proceedings Paper |
| ISSN | 0960-1295 |
| Résumé | A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed in Chee et al. (2013) within a constant factor of optimality. We propose a Gray code for these cross-bifix-free sets and a CAT algorithm generating it. Our Gray code list is trace partitioned, that is, words with zero in the same positions are consecutive in the list. |
| DOI | 10.1017/S0960129515000067 |