2 citations · 2 across the 1 of their papers we have counts for
4 papers
Lower Bounds on Regular Expression Size
Hamoon Mousavi
We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound o…
Shortest Repetition-Free Words Accepted by Automata
Hamoon Mousavi, Jeffrey Shallit
We consider the following problem: given that a finite automaton of states accepts at least one -power-free (resp., overlap-free) word, what is the length of the shortes…
Repetition Avoidance in Circular Factors
Hamoon Mousavi, Jeffrey Shallit
We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitio…
On the Number of Unbordered Factors
Daniel Goc, Hamoon Mousavi, Jeffrey Shallit
We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We s…