نبذة مختصرة : For every pattern p over the alphabet {x, x^R, y, y^R}, we specify the least k such that p is k-avoidable. ; The first author was supported by an NSERC Discovery Grant, and also by Deutsche Forschungsge-meinschaft, which supported him through its Mercator program. The second author was supported through the NSERC USRA program. ; http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p36
No Comments.