State complexity of regular languages
Journal of Automata, Languages and Combinatorics
On the state complexity of reversals of regular languages
Theoretical Computer Science
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Minimal DFA for symmetric difference NFA
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
In search of most complex regular languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which is the same as the state complexity of L, is the number of quotients of L. We prove that, for any language L with quotient complexity n, the quotient complexity of any atom of L with r complemented quotients has an upper bound of 2n−1 if r=0 or r=n, and $1+\sum_{k=1}^{r} \sum_{h=k+1}^{k+n-r} C_{h}^{n} \cdot C_{k}^{h}$ otherwise, where $C_j^i$ is the binomial coefficient. For each $n\geqslant 1$, we exhibit a language whose atoms meet these bounds.