Now showing items 1-4 of 4

• #### Most Complex Regular Ideal Languages ﻿

(Discrete Mathematics and Theoretical Computer Science, 2016-10-17)
A right ideal (left ideal, two-sided ideal) is a non-empty 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 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 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 ...
• #### 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 ...

UWSpace

University of Waterloo Library
200 University Avenue West