Name
Abstract | ||
|---|---|---|
In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \geq 1$. We will prove that this generation is exhaustive, that is, all such binary words are generated. |
Year | Venue | Field |
|---|---|---|
2012 | CoRR | Bit-length,Discrete mathematics,Combinatorics,Binary pattern,Mathematics,Binary number |
DocType | Volume | Citations |
Journal | abs/1210.7620 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefano Bilotta | 1 | 32 | 9.62 |
| Elisabetta Grazzini | 2 | 44 | 17.57 |
| Elisa Pergola | 3 | 149 | 18.60 |
| Renzo Pinzani | 4 | 341 | 67.45 |