Browsing University of Waterloo by Subject "partially monotonic automaton"
Now showing items 1-1 of 1
-
Syntactic Complexities of Six Classes of Star-Free Languages
(Otto-von-Guericke-Universit¨at Magdeburg, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semi-group. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...