Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Pure Mathematics and Applications
Volume 25 (2015): Issue 1 (September 2015)
Open Access
A generating function for bit strings with no Grand Dyck pattern matching
Antonio Bernini
Antonio Bernini
Search for this author on
Sciendo
|
Google Scholar
Bernini, Antonio
,
Stefano Bilotta
Stefano Bilotta
Search for this author on
Sciendo
|
Google Scholar
Bilotta, Stefano
,
Elisa Pergola
Elisa Pergola
Search for this author on
Sciendo
|
Google Scholar
Pergola, Elisa
and
Renzo Pinzani
Renzo Pinzani
Search for this author on
Sciendo
|
Google Scholar
Pinzani, Renzo
Oct 07, 2015
Pure Mathematics and Applications
Volume 25 (2015): Issue 1 (September 2015)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Oct 07, 2015
Page range:
30 - 44
Received:
Sep 22, 2014
DOI:
https://doi.org/10.1515/puma-2015-0003
Keywords
binary word
,
pattern avoidance
,
Grand Dyck pattern
© 2015
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
