Pattern 1^j0^i avoiding binary words
Formal Languages and Automata Theory
2011-08-19 v1 Discrete Mathematics
Combinatorics
Abstract
In this paper we study the enumeration and the construction, according to the number of ones, of particular binary words avoiding a fixed pattern. 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 fixed number of ones and then kills those containing the forbidden pattern.
Keywords
Cite
@article{arxiv.1108.3621,
title = {Pattern 1^j0^i avoiding binary words},
author = {Stefano Bilotta and Elisa Pergola and Renzo Pinzani},
journal= {arXiv preprint arXiv:1108.3621},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412