We provide a trace and a prefix partitioned Gray code for the strings on a q-ary alphabet avoiding a pattern constituted by k consecutive equal symbols. The method moves from a Gray code defined for binary strings avoiding k consecutive 0’s.
Two Gray codes for q-ary k-generalized Fibonacci strings / Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Vincent Vajnovszki. - ELETTRONICO. - (2013), pp. 1-6. (Intervento presentato al convegno ICTCS 2013 tenutosi a Palermo nel 09/09/2013 - 11/09/2013).
Two Gray codes for q-ary k-generalized Fibonacci strings
BERNINI, ANTONIO;BILOTTA, STEFANO;PINZANI, RENZO;
2013
Abstract
We provide a trace and a prefix partitioned Gray code for the strings on a q-ary alphabet avoiding a pattern constituted by k consecutive equal symbols. The method moves from a Gray code defined for binary strings avoiding k consecutive 0’s.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
