Let F^[p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)^j1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F^[p].
Counting Binary Words Avoiding Alternating Patterns / Stefano Bilotta; Elisabetta Grazzini; Elisa Pergola. - In: JOURNAL OF INTEGER SEQUENCES. - ISSN 1530-7638. - ELETTRONICO. - 16, Article 13.4.8:(2013), pp. 1-17.
Counting Binary Words Avoiding Alternating Patterns
BILOTTA, STEFANO;GRAZZINI, ELISABETTA;PERGOLA, ELISA
2013
Abstract
Let F^[p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)^j1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F^[p].
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
grazzini2.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
236.27 kB
Formato
Adobe PDF
|
236.27 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
