Browsing Waterloo Research by Subject "Suffix-closed"
Now showing items 1-2 of 2
-
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
(Springer, 2017-03-06)A language L over an alphabet Σ is suffix-convex if, for any words x,y,z∈Σ∗, whenever z and xyz are in L, then so is yz. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free ... -
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 ...