Pattern 1ʲ+10ʲ avoiding binary words

DOI10.3233/FI-2012-687MaRDI QIDQ2898445zbMATH OpenOpenAlexFDO

Authors Tefano Bilotta, Donatella Merlini, E. Pergola, R. Pinzani

Publication date 11 July 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2012-687

zbMATH Keywords

binary wordsgenerating treepattern avoidancesuccession rule

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Pattern 1ʲ⁰^i avoiding binary words
• A construction for a class of binary words avoiding 1ʲ⁰^i
• Avoiding cross-bifix-free binary words
• Counting binary words avoiding alternating patterns
• Binary words excluding a pattern and proper Riordan arrays

Cited in

(13)

• Every binary pattern of length six is avoidable on the two-letter alphabet
• A 2D non-overlapping code over a q-ary alphabet
• Avoiding cross-bifix-free binary words
• Pattern 1ʲ⁰^i avoiding binary words
• A generating function for bit strings with no Grand Dyck pattern matching
• Algebraic generating functions for languages avoiding Riordan patterns
• A construction for a class of binary words avoiding 1ʲ⁰^i
• Counting binary words avoiding alternating patterns
• Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
• A new combinatorial interpretation of partial sums of m-step Fibonacci numbers
• Two-dimensional q-ary non-overlapping codes
• Gray code orders for \(q\)-ary words avoiding a given factor
• Binary words excluding a pattern and proper Riordan arrays

This page was built for publication: Pattern \(1^{j+1}0^{j}\) avoiding binary words

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