Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-12-31
Computer Science
Formal Languages and Automata Theory
17 pages, 2 figures, 9 tables
Scientific paper
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 2^n-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\ge 1, we exhibit a language whose atoms meet these bounds.
Brzozowski Janusz
Tamm Hellis
No associations
LandOfFree
Quotient Complexities of Atoms of Regular Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quotient Complexities of Atoms of Regular Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quotient Complexities of Atoms of Regular Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-673654