Browsing Mathematics (Faculty of) by Subject "universal witness"
Now showing items 12 of 2

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