Browsing Waterloo Research by Subject "atom"
Now showing items 14 of 4

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