1 citations · 2 across the 9 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DM2019
Borders, Palindrome Prefixes, and Square Prefixes
Daniel Gabric, Jeffrey Shallit
We show that the number of length-n words over a k-letter alphabet having no even palindromic prefix is the same as the number of length-n unbordered words, by constructing an expl…
cs.FL2019
Circularly squarefree words and unbordered conjugates: a new approach
Trevor Clokie, Daniel Gabric, Jeffrey Shallit
Using a new approach based on automatic sequences, logic, and a decision procedure, we reprove some old theorems about circularly squarefree words and unbordered conjugates in a ne…
cs.FL2019
Maximal State Complexity and Generalized de Bruijn Words
Daniel Gabric, Štěpán Holub, Jeffrey Shallit
We compute the exact maximum state complexity for the language consisting of words of length , and characterize languages achieving the maximum. We also consider a special c…