Loading…

QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of foundations of computer science 2012-09, Vol.23 (6), p.1261-1276
Main Authors: BRZOZOWSKI, JANUSZ, LIU, BO
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 2n-1 is a lower bound for reversal.
ISSN:0129-0541
1793-6373
DOI:10.1142/S0129054112400515