Browsing Waterloo Research by Subject "syntactic semigroup"
Now showing items 19 of 9

Complexity Of Atoms Of Regular Languages
(World Scientific Publishing, 20131101)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 nonempty regular language L with n quotients is a nonempty intersection of the n ... 
Complexity of proper prefixconvex regular languages
(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
(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 ... 
In Search Of Most Complex Regular Languages
(World Scientific Publishing, 20130901)Sequences (Ln vertical bar n >= k), called streams, of regular languages Ln are considered, where k is some small positive integer, n is the state complexity of Ln, and the languages in a stream differ only in the ... 
Most Complex Regular Ideal Languages
(Discrete Mathematics and Theoretical Computer Science, 20161017)A right ideal (left ideal, twosided ideal) is a nonempty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ... 
Most Complex Regular RightIdeal 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 rightideal languages, where Rn has n left quotients ... 
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 ... 
Syntactic Complexities of Six Classes of StarFree Languages
(OttovonGuerickeUniversit¨at Magdeburg, 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 Complexities of Some Classes of StarFree 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, ...