Browsing Waterloo Research by Subject "Most complex"
Now showing items 1-4 of 4
-
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 ... -
Complexity of Proper Prefix-Convex Regular Languages
(Springer, 2017-06-27)A language L over an alphabet Σ is prefix-convex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ... -
Complexity of Suffix-Free Regular Languages
(Elsevier, 2017-11-01)We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the ... -
Most Complex Non-returning Regular Languages
(Springer, 2017-07-03)A regular language L is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derived upper bounds on the state complexity of ...