A generating function for bit strings with no Grand Dyck pattern matching

DOI10.1515/PUMA-2015-0003MaRDI QIDQ2973209zbMATH OpenOpenAlexFDO

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

Publication date 31 March 2017

Published in Pure Mathematics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/puma-2015-0003

zbMATH Keywords

pattern avoidancepattern matchingbinary wordGrand-Dyck pattern

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Avoiding cross-bifix-free binary words
• Pattern \(1^{j+1}0^{j}\) avoiding binary words
• A construction for a class of binary words avoiding 1ʲ⁰^i
• Algebraic generating functions for languages avoiding Riordan patterns
• Pattern 1ʲ⁰^i avoiding binary words

This page was built for publication: A generating function for bit strings with no Grand Dyck pattern matching

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