Have a personal or library account? Click to login
A generating function for bit strings with no Grand Dyck pattern matching Cover

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

Pure Mathematics and Applications
Volume 25 (2015): Issue 1 (September 2015)
By: Antonio Bernini,  Stefano Bilotta,  Elisa Pergola and  Renzo Pinzani  
Open Access
|Oct 2015

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.1515/puma-2015-0003 | Journal eISSN: 1788-800X
Journal RSS Feed
Language: English
Page range: 30 - 44
Submitted on: Sep 22, 2014
Published on: Oct 7, 2015
Published by: Corvinus University of Budapest
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
binary word,
pattern avoidance,
Grand Dyck pattern
Related subjects:
Computer sciences,
Theoretical computer sciences,
Business and economics,
Mathematics and statistics for economists,
Mathematics,
Mathematics,
Analysis,
Differential equations and dynamical systems

© 2015 Antonio Bernini, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 25 (2015): Issue 1 (September 2015)Next article