2015/08/10 by James D. Currie, Currie, James D., Philip Lafrance +1 · 1 citation
Computer Science · Mathematics · #68R15 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #cs.FL #math.CO #msc:68R15
paper · pdf · doi:10.48550/arxiv.1508.02101
15 pages, 1 figure
arxiv created 2015/08/21 · arxiv updated 2015/08/24
For every pattern p over the alphabet \x,y,xR,yR\, we specify the least k such that p is k-avoidable.