Deim Seminar
Title
Pattern avoidance and cross-bifix-free words
Conferenciant
Renzo Pinzani
Professor/a organitzador/a
Maria Bras-Amorós
Institution
Università degli Studi di Firenze
Date
23-10-2012 11:00
Summary
Words of any language avoiding some patterns (that is which do not contain some particular sequences of symbols) have different applications in many fields.
We consider the enumeration (according to the number of 1?s) and the generation of binary words avoiding the sequence 1^{j+1}0^j and such that their of 0?s is not greater than their number of 1?s.
To achieve this we apply an ECO method generalization using the so called jumping and marked rules. In such a way words containing the forbidden pattern are produced but then deleted by means of marked rules.
The same technique is later applied to words avoiding a pattern 1^j0^i (0PlaceLaboratori 231
Language
Anglès
