Browsing Mathematics (Faculty of) by Subject "Quotient/state complexity"
Now showing items 1-1 of 1
-
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 ...