Pattern 1^j0^i avoiding binary words

Elisa Pergola (University of Florence); Renzo Pinzani (University of Florence); Stefano Bilotta (University of Florence)

arxiv: 1108.3621 · v1 · pith:DDM4XMXInew · submitted 2011-08-18 · 💻 cs.FL · cs.DM· math.CO

Pattern 1^j0^i avoiding binary words

Stefano Bilotta (University of Florence) , Elisa Pergola (University of Florence) , Renzo Pinzani (University of Florence) This is my paper

classification 💻 cs.FL cs.DMmath.CO

keywords wordsbinarypatternavoidingfixednumberonesparticular

0 comments

read the original 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.

This paper has not been read by Pith yet.

Pattern 1^j0^i avoiding binary words

discussion (0)