1 citations · 2 across the 9 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2020
The Simplest Binary Word with Only Three Squares
Daniel Gabric, Jeffrey Shallit
We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new co…
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…