Generation of binary words avoiding alternating patterns
Discrete Mathematics
2012-10-30 v1 Combinatorics
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 for any fixed . We will prove that this generation is exhaustive, that is, all such binary words are generated.
Cite
@article{arxiv.1210.7620,
title = {Generation of binary words avoiding alternating patterns},
author = {Stefano Bilotta and Elisabetta Grazzini and Elisa Pergola and Renzo Pinzani},
journal= {arXiv preprint arXiv:1210.7620},
year = {2012}
}
Comments
15 pages with figures