Affiliation:
1. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada
Abstract
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Reference10 articles.
1. Finite-automaton aperiodicity is PSPACE-complete
2. State complexity of basic operations on suffix-free regular languages
3. Y.S. Han , K. Salomaa and D. Wood , Automata, Formal Languages, and Related Topics, eds. Z. Ésik and Z. Fülöp (University of Szeged, Hungary, 2009) pp. 99–115.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献