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.
Gray code orders for q-ary words avoiding a given factor / Bernini, A.; Bilotta, S.; Pinzani, R.; Sabri, A.; Vajnovszki, V.. - In: ACTA INFORMATICA. - ISSN 0001-5903. - STAMPA. - 52:(2015), pp. 573-592. [10.1007/s00236-015-0225-2]
Gray code orders for q-ary words avoiding a given factor
BERNINI, ANTONIO;BILOTTA, STEFANO;PINZANI, RENZO;
2015
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
1404.0823_given_factor.pdf
accesso aperto
Tipologia:
Altro
Licenza:
Tutti i diritti riservati
Dimensione
250.64 kB
Formato
Adobe PDF
|
250.64 kB | Adobe PDF | |
|
Article_GrayCodeOrdersForQQ-aryWordsAv.pdf
Accesso chiuso
Tipologia:
Pdf editoriale (Version of record)
Dimensione
621.98 kB
Formato
Adobe PDF
|
621.98 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
