Binary words excluding a pattern and proper Riordan arrays

DOI10.1016/J.DISC.2006.07.023zbMath1111.05004OpenAlexW1970861401MaRDI QIDQ870961

Renzo Sprugnoli, Davide Baccherini, Donatella Merlini

Publication date: 15 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.023

zbMATH Keywords

generating functionswords avoiding a pattern

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Related Items (5)

Left multiplication operators on the Riordan group ⋮ Proper generating trees and their internal path length ⋮ Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern ⋮ Riordan arrays and related polynomial sequences ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• String overlaps, pattern matching, and nontransitive games
• The Riordan group
• Pascal triangles, Catalan numbers and renewal arrays
• Underdiagonal lattice paths with unrestricted steps
• Riordan arrays and combinatorial sums
• Waiting patterns for a printer
• Some summation rules related to the Riordan arrays
• Some identities related to reciprocal functions
• Bijections and the Riordan group
• Generating trees and proper Riordan arrays
• Long repetitive patterns in random sequences
• On Some Alternative Characterizations of Riordan Arrays
• ECO:a methodology for the enumeration of combinatorial objects

This page was built for publication: Binary words excluding a pattern and proper Riordan arrays