Browsing Waterloo Research by Subject "Prefix-convex"
Now showing items 1-1 of 1
-
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 ...