Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-08-18
EPTCS 63, 2011, pp. 53-64
Computer Science
Formal Languages and Automata Theory
In Proceedings WORDS 2011, arXiv:1108.3412
Scientific paper
10.4204/EPTCS.63.9
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.
Bilotta Stefano
Pergola Elisa
Pinzani Renzo
No associations
LandOfFree
Pattern 1^j0^i avoiding binary words 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 Pattern 1^j0^i avoiding binary words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern 1^j0^i avoiding binary words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-180573