This work is related to pattern avoidance, that is, strings over a given alphabet which can not contain a determined substring or patttern. We study the constraction and enumeration of binary words having more 1's than 0's and avoiding a cross-bifix-free set of Grand Dyck words.
Grand Dyck consecutive patterns avoiding binary words / Antonio Bernini; Stefano Bilotta; Elisa Pergola; Renzo Pinzani. - STAMPA. - (2013), pp. 23-25. (Intervento presentato al convegno Permutation Patterns 2013 tenutosi a Parigi nel 01/07/2013 - 05/07/2013).
Grand Dyck consecutive patterns avoiding binary words
BERNINI, ANTONIO;BILOTTA, STEFANO;PERGOLA, ELISA;PINZANI, RENZO
2013
Abstract
This work is related to pattern avoidance, that is, strings over a given alphabet which can not contain a determined substring or patttern. We study the constraction and enumeration of binary words having more 1's than 0's and avoiding a cross-bifix-free set of Grand Dyck words.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
