episciences.org_1343_1635093485
1635093485
episciences.org
raphael.tournoy+crossrefapi@ccsd.cnrs.fr
episciences.org
Discrete Mathematics & Theoretical Computer Science
1365-8050
10
17
2016
Vol. 18 no. 3
Automata, Logic and Semantics
Most Complex Regular Ideal Languages
Janusz
Brzozowski
Sylvie
Davies
Bo Yang Victor
Liu
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
two-sided ideals. We show that there exist sequences ($L_n \mid n \ge k $) of
right, left, and two-sided regular ideals, where $L_n$ has quotient complexity
(state complexity) $n$, such that $L_n$ is most complex in its class under the
following measures of complexity: the size of the syntactic semigroup, the
quotient complexities of the left quotients of $L_n$, the number of atoms
(intersections of complemented and uncomplemented left quotients), the quotient
complexities of the atoms, and the quotient complexities of reversal, star,
product (concatenation), and all binary boolean operations. In that sense,
these ideals are "most complex" languages in their classes, or "universal
witnesses" to the complexity of the various operations.
10
17
2016
1343
arXiv:1511.00157
10.46298/dmtcs.1343
https://dmtcs.episciences.org/1343