H
Hamoon Mousavi
Researcher at University of Waterloo
Publications - 23
Citations - 329
Hamoon Mousavi is an academic researcher from University of Waterloo. The author has contributed to research in topics: Morphism & Fibonacci number. The author has an hindex of 9, co-authored 23 publications receiving 251 citations. Previous affiliations of Hamoon Mousavi include McAfee & University of Toronto.
Papers
More filters
Posted Content
Automatic Theorem Proving in Walnut.
TL;DR: Walnut is a software package that implements a mechanical decision procedure for deciding certain combinatorial properties of some special words referred to as automatic words or automatic sequences.
Journal ArticleDOI
Decision algorithms for Fibonacci-automatic Words, I: Basic results
TL;DR: A decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) “Fibonacci-automatic”, which includes the famous Fibonacci word f.
Posted Content
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance
TL;DR: There exists an aperiodic infinite binary word avoiding the pattern x x x^R, which is the first avoidability result concerning a nonuniform morphism proven purely mechanically.
Journal ArticleDOI
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
TL;DR: This paper shows how enumeration questions (such as counting the number of squares of length n in the Fibonacci word) can be decided purely mechanically, using a decision procedure.
Book ChapterDOI
On the Number of Unbordered Factors
TL;DR: In this article, a conjecture on the number of unbordered factors of the Thue-Morse sequence has been proved, and it has been shown that f(n) ≤ n for n ≥ 4 and that f (n) = n infinitely often.