| dc.contributor.author | Currie, James D. | |
| dc.contributor.author | Lafrance, Phillip | |
| dc.date.accessioned | 2019-12-02T17:40:25Z | |
| dc.date.available | 2019-12-02T17:40:25Z | |
| dc.date.issued | 2017 | |
| dc.identifier.citation | Electr. J. Comb. 23(1) (2016), P1.36. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10680/1754 | |
| dc.description.abstract | For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable. | en_US |
| dc.description.sponsorship | NSERC | en_US |
| dc.description.uri | www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p36/pdf | en_US |
| dc.language.iso | en | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | combinatorics on words, words avoiding patterns, patterns with reversal | en_US |
| dc.title | Avoidability index for binary patterns with reversal | en_US |
| dc.type | Article | en_US |
