Binary words avoiding a pattern and marked succession rule

Details Binary words avoiding a pattern and marked succession rule Binary words avoiding a pattern and marked succession rule

2011-03-29

arxiv.org/abs/1103.5689v1

Computer Science

Discrete Mathematics

19

Scientific paper

In this paper we study the enumeration and the construction of particular binary words avoiding the pattern $1^{j+1}0^j$. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a path in the generating tree obtained by the succession rule is solved by introducing an algorithm which constructs all binary words and then kills those containing the forbidden pattern.

Affiliated with

Also associated with

No associations

Rating

Binary words avoiding a pattern and marked succession rule does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Binary words avoiding a pattern and marked succession rule, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary words avoiding a pattern and marked succession rule will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163858