#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2013

2017

- This year (0)
- Last 5 years (12)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hamoon Mousavi
- ArXiv
- 2016

2 Basics 3 2.1 Words and Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Number Systems . . . . . . . . . . . . . . . . . . .… (More)

- Hamoon Mousavi, Jeffrey Shallit
- Developments in Language Theory
- 2013

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 repetitions in all factors… (More)

- Hamoon Mousavi, Jeffrey Shallit
- WORDS
- 2015

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) “Tribonacci-automatic”. This class includes, for example,… (More)

- Hamoon Mousavi, Jeffrey Shallit
- DCFS
- 2013

We consider the following problem: given that a finite automaton M of N states accepts at least one k-power-free (resp., overlapfree) word, what is the length of the shortest such word accepted? We… (More)

- Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit
- ArXiv
- 2014

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) “Fibonacci-automatic”. This class includes, for example, the… (More)

- Daniel Goc, Hamoon Mousavi, Jeffrey Shallit
- LATA
- 2013

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 show that f (n) ≤ n… (More)

- Hamoon Mousavi
- ArXiv
- 2017

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 on the size of any… (More)

- Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit
- RAIRO - Theor. Inf. and Applic.
- 2016

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) “Fibonacci-automatic”. This class includes, for example, the… (More)

- Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit
- Int. J. Found. Comput. Sci.
- 2016

We continue our study the class of Fibonacci-automatic words. These are infinite sequences whose nth term is defined in terms of a finite-state function of the Fibonacci representation of n. In this… (More)