Browsing Waterloo Research by Subject "monotonic"
Now showing items 1-2 of 2
-
Large Aperiodic Semigroups
(World Scientific Publishing, 2015-11-01)We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ... -
Syntactic Complexities of Some Classes of Star-Free Languages
(Springer, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...