Pattern 1ʲ+10ʲ avoiding binary words

DOI10.3233/FI-2012-687zbMATH Open1245.68149OpenAlexW1743863382MaRDI QIDQ2898445FDOQ2898445

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

Recommendations

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

zbMATH Keywords

pattern avoidancegenerating treebinary wordssuccession rule

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (11)

• Pattern \(1^j0^i\) avoiding binary words
• Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
• Counting binary words avoiding alternating patterns
• Binary words excluding a pattern and proper Riordan arrays
• 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
• Gray code orders for \(q\)-ary words avoiding a given factor
• A generating function for bit strings with no Grand Dyck pattern matching
• A construction for a class of binary words avoiding \(1^j0^i\)
• Algebraic generating functions for languages avoiding Riordan patterns

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)