Afficher la notice abrégée

dc.contributor.authorCurrie, James D.
dc.contributor.authorLafrance, Phillip
dc.date.accessioned2019-12-02T17:40:25Z
dc.date.available2019-12-02T17:40:25Z
dc.date.issued2017
dc.identifier.citationElectr. J. Comb. 23(1) (2016), P1.36.en_US
dc.identifier.urihttp://hdl.handle.net/10680/1754
dc.description.abstractFor 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.sponsorshipNSERCen_US
dc.description.uriwww.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p36/pdfen_US
dc.language.isoenen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectcombinatorics on words, words avoiding patterns, patterns with reversalen_US
dc.titleAvoidability index for binary patterns with reversalen_US
dc.typeArticleen_US


Fichier(s) constituant ce document

Thumbnail

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée