Now showing items 1-20 of 856

• #### Halfway to Halfspace Testing ﻿

(University of Waterloo, 2017-10-18)
In this thesis I study the problem of testing halfspaces under arbitrary probability distributions, using only random samples. A halfspace, or linear threshold function, is a boolean function f : Rⁿ → {±1} defined as the ...
• #### Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language ﻿

(Institute of Informatics: University of Szeged, 2014)
A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by subword" we mean subsequence", ...
• #### 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 ...
• #### Quotient Complexities of Atoms in Regular Ideal Languages ﻿

(Institute of Informatics: University of Szeged, 2015)
A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ...
• #### The Positive and Negative Influence of Search Results on People's Decisions about the Efficacy of Medical Treatments ﻿

(ACM, 2017-10-01)
People regularly use web search engines to investigate the efficacy of medical treatments. Search results can contain documents that present incorrect information that contradicts current established medical understanding ...
• #### In Search Of Most Complex Regular Languages ﻿

(World Scientific Publishing, 2013-09-01)
Sequences (L-n vertical bar n >= k), called streams, of regular languages L-n are considered, where k is some small positive integer, n is the state complexity of L-n, and the languages in a stream differ only in the ...
• #### On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions ﻿

(World Scientific Publishing, 2012-01-01)
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions ...
• #### Quotient Complexity Of Star-Free Languages ﻿

(World Scientific Publishing, 2012-09-01)
The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ...
• #### Complexity Of Atoms Of Regular Languages ﻿

(World Scientific Publishing, 2013-11-01)
The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ...
• #### Most Complex Regular Right-Ideal Languages ﻿

(Springer, 2014)
A right ideal is a language L over an alphabet Sigma that satisfies the equation L = L Sigma*. We show that there exists a sequence (Rn vertical bar n >= 3) of regular right-ideal languages, where R-n has n left quotients ...
• #### Quotient Complexity Of Closed Languages ﻿

(Springer, 2014-02-01)
A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ...
• #### Theory Of Atomata ﻿

(Elsevier, 2014-06-19)
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or ...
• #### Syntactic Complexity Of R- And J-Trivial Regular Languages ﻿

(World Scientific Publishing, 2014-11-01)
The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ...
• #### Large Aperiodic Semigroups ﻿

(World Scientific Publishing, 2015-11-01)
We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ...
• #### Syntactic Complexities Of Some Classes Of Star-Free Languages ﻿

(Springer, 2012)
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...
• #### 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 ...
• #### 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 ...
• #### 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 ...
• #### Testing Submodularity ﻿

(University of Waterloo, 2017-09-28)
We show that for any constants $\epsilon > 0$ and $p \ge 1$, given oracle access to an unknown function $f : \{0,1\}^n \to [0,1]$ it is possible to determine if the function is submodular or is $\epsilon$-far from every ...

UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883