## Search

Now showing items 1-10 of 158

#### The Liftable Mapping Class Group

(University of Waterloo, 2017-07-19)

Broadly, this thesis lies at the interface of mapping class groups and covering spaces. The foundations of this area were laid down in the early 1970s by Birman and Hilden. Building on these foundations, there has been a ...

#### A TMT-labeled Spectral Library for Peptide Sequencing

(University of Waterloo, 2017-12-07)

Tandem mass spectrometry (MS/MS) is widely used nowadays for bioinformaticians to identify peptides and proteins. Three major peptide identification approaches and tools have been developed over the past two decades: ...

#### 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 ...

#### A Dynamic Risk-Based Access Control Approach: Model and Implementation

(University of Waterloo, 2017-05-18)

Access control (AC) refers to mechanisms and policies that restrict access to resources, thus regulating access to physical or virtual resources of an information system. AC approaches are used to represent these mechanisms ...

#### Extending Pappus' Theorem

(University of Waterloo, 2017-12-22)

Let $M_1$ and $M_2$ be matroids such that $M_2$ arises from $M_1$ by relaxing a circuit-hyperplane.
We will prove that if $M_1$ and $M_2$ are both representable over some finite field $GF(q)$,
then $M_1$ and $M_2$ have ...

#### Complexity of Suffix-Free Regular Languages

(Elsevier, 2017-11-01)

We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the ...

#### Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages

(Institut für Informatik, 2017-08-27)

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, ...

#### Syntactic Complexity of Regular Ideals

(Springer, 2017-08-04)

The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ...

#### Syntactic Complexity of Suffix-Free Languages

(Elsevier, 2017-09-05)

We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n−1)n−2+n−2 ...

#### On Some Stochastic Optimal Control Problems in Actuarial Mathematics

(University of Waterloo, 2017-01-17)

The event of ruin (bankruptcy) has long been a core concept of risk management interest in the literature of actuarial science. There are two major research lines. The first one focuses on distributional studies of some ...