Browsing University of Waterloo by Author "Sinnamon, Corwin"
Now showing items 1-6 of 6
-
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
Brzozowski, Janusz; Sinnamon, Corwin (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
Brzozowski, Janusz; Sinnamon, Corwin (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 proper prefix-convex regular languages
Brzozowski, Janusz; Sinnamon, Corwin (Elsevier, 2019-10-01)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 Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
Brzozowski, Janusz; Sinnamon, Corwin (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 ... -
Efficient Representation and Encoding of Distributive Lattices
Sinnamon, Corwin (University of Waterloo, 2018-08-20)This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a well-known class of partially-ordered sets having two natural operations ... -
Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages
Brzozowski, Janusz; Sinnamon, Corwin (Institut für Informatik, 2017-08-27)We study the state complexity of binary operations on regular languages over different alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, ...