Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quotient Complexities of Atoms of Regular Languages (1201.0295v2)

Published 31 Dec 2011 in cs.FL

Abstract: 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_ji is the binomial coefficient. For each n\ge 1, we exhibit a language whose atoms meet these bounds.

Citations (23)

Summary

We haven't generated a summary for this paper yet.