Browsing Mathematics (Faculty of) by Subject "nearly monotonic"
Now showing items 1-1 of 1
-
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, ...