Browsing Waterloo Research by Subject "Factor-closed"
Now showing items 1-1 of 1
-
Syntactic Complexity of Regular Ideals
(Springer, 2017-08-04)The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ...