Quotient Complexity of Star-Free Languages

Details Quotient Complexity of Star-Free Languages Quotient Complexity of Star-Free Languages

2010-12-17

arxiv.org/abs/1012.3962v1

Computer Science

Formal Languages and Automata Theory

15 pages. 6 figures. 1 Table

Scientific paper

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 language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite languages and closed under boolean operations and concatenation. We prove that the tight bounds on the quotient complexities of union, intersection, difference, symmetric difference, concatenation, and star for star-free languages are the same as those for regular languages, with some small exceptions, whereas the bound for reversal is 2^n-1.

Affiliated with

Also associated with

No associations

Rating

Quotient Complexity of Star-Free 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 Complexity of Star-Free Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quotient Complexity of Star-Free Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-639580