Browsing Waterloo Research by Subject "complexity of operations"
Now showing items 1-1 of 1
-
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
(Institute of Informatics: University of Szeged, 2017)A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free ...