Browsing University of Waterloo by Author "Sinnamon, Corwin"
Now showing items 16 of 6

Complexity of LeftIdeal, SuffixClosed and SuffixFree Regular Languages
Brzozowski, Janusz; Sinnamon, Corwin (Springer, 20170306)A language L over an alphabet Σ is suffixconvex if, for any words x,y,z∈Σ∗, whenever z and xyz are in L, then so is yz. Suffixconvex languages include three special cases: leftideal, suffixclosed, and suffixfree ... 
Complexity of Proper PrefixConvex Regular Languages
Brzozowski, Janusz; Sinnamon, Corwin (Springer, 20170627)A language L over an alphabet Σ is prefixconvex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefixconvex languages include rightideal, prefixclosed, and prefixfree languages, which were ... 
Complexity of proper prefixconvex regular languages
Brzozowski, Janusz; Sinnamon, Corwin (Elsevier, 20191001)A language L over an alphabet Σ is prefixconvex if, for any words x,y,z ∈ Σ*, whenever x and xyz are in L, then so is xy. Prefixconvex languages include rightideal, prefixclosed, and prefixfree languages, which were ... 
Complexity of RightIdeal, PrefixClosed, and PrefixFree Regular Languages
Brzozowski, Janusz; Sinnamon, Corwin (Institute of Informatics: University of Szeged, 2017)A language L over an alphabet E is prefixconvex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefixconvex languages include rightideal, prefixclosed, and prefixfree ... 
Efficient Representation and Encoding of Distributive Lattices
Sinnamon, Corwin (University of Waterloo, 20180820)This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a wellknown class of partiallyordered sets having two natural operations ... 
Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages
Brzozowski, Janusz; Sinnamon, Corwin (Institut für Informatik, 20170827)We study the state complexity of binary operations on regular languages over diﬀerent 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, ...