Pattern 1ʲ⁰^i avoiding binary words

DOI10.4204/EPTCS.63.9MaRDI QIDQ2789513zbMATH OpenFDO

Authors E. Pergola, R. Pinzani, S. Bilotta

Publication date 1 March 2016

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.3621, http://www.emis.de/proceedings/Words2011/paper-7.html?WORDS2011.9

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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.

Recommendations

• A construction for a class of binary words avoiding 1ʲ⁰^i
• Pattern \(1^{j+1}0^{j}\) avoiding binary words
• Counting binary words avoiding alternating patterns
• Avoiding cross-bifix-free binary words
• BINARY PATTERNS IN BINARY WORDS

Cited in

(7)

• Every binary pattern of length six is avoidable on the two-letter alphabet
• Pattern \(1^{j+1}0^{j}\) avoiding binary words
• A generating function for bit strings with no Grand Dyck pattern matching
• Binary words avoiding xx^Rx and strongly unimodal sequences
• A construction for a class of binary words avoiding 1ʲ⁰^i
• Counting binary words avoiding alternating patterns
• Binary words excluding a pattern and proper Riordan arrays

This page was built for publication: Pattern \(1^j0^i\) avoiding binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789513)