<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We study the construction and the enumeration of bit strings, or binary words in {0, 1}*, having more 1’s than 0’s and avoiding a set of Grand Dyck patterns which form a cross-bifix-free set. We give a particular jumping and marked succession rule which describes the growth of such words according to the number of 1’s. Then, we give the enumeration of the class by means of generating function. </p></abstract>

We study the construction and the enumeration of bit strings, or binary words in {0, 1}*, having more 1’s than 0’s and avoiding a set of Grand Dyck patterns which form a cross-bifix-free set. We give a particular jumping and marked succession rule which describes the growth of such words according to the number of 1’s. Then, we give the enumeration of the class by means of generating function.

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

Dipartimento di Matematica e Informatica “U. Dini„ Università degli Studi di Firenze Viale G.B. Morgagni 65, 50134 Firenze, Italy

Pure Mathematics and Applications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"A generating function for bit strings with no Grand Dyck pattern matching"}

We study the construction and the enumeration of bit strings, or binary words in {0, 1}*, having more 1’s than 0’s and avoiding a set of Grand Dyck patterns...

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

Online veröffentlicht: 07. Okt. 2015

Seitenbereich: 30 - 44

Eingereicht: 22. Sept. 2014

DOI: https://doi.org/10.1515/puma-2015-0003

Schlüsselwörter
binary word, pattern avoidance, Grand Dyck pattern

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Online veröffentlicht: 07. Okt. 2015

Seitenbereich: 30 - 44

Eingereicht: 22. Sept. 2014

DOI: https://doi.org/10.1515/puma-2015-0003

Schlüsselwörterbinary word, pattern avoidance, Grand Dyck pattern

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
binary word, pattern avoidance, Grand Dyck pattern