In this paper we study the enumeration and the construction, according to the number of ones, of particular binary words avoiding the pattern p(j,i) = 1^j 0^i, 0 < i < j. The growth of such words can be described by particular jumping and marked succession rules. This approach enables us to obtain an algorithm which constructs all binary words having a xed number of ones and then kills those containing the forbidden pattern.
A construction for a class of binary words avoiding 1^j 0^i / S. Bilotta; E. Pergola; R. Pinzani. - In: PURE MATHEMATICS AND APPLICATIONS. - ISSN 1218-4586. - ELETTRONICO. - 23:(2012), pp. 81-102.
A construction for a class of binary words avoiding 1^j 0^i
BILOTTA, STEFANO;PERGOLA, ELISA;PINZANI, RENZO
2012
Abstract
In this paper we study the enumeration and the construction, according to the number of ones, of particular binary words avoiding the pattern p(j,i) = 1^j 0^i, 0 < i < j. The growth of such words can be described by particular jumping and marked succession rules. This approach enables us to obtain an algorithm which constructs all binary words having a xed number of ones and then kills those containing the forbidden pattern.
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.
