Quotient Complexity of Regular Languages

  title={Quotient Complexity of Regular Languages},
  author={Janusz A. Brzozowski},
  booktitle={J. Autom. Lang. Comb.},
  • J. Brzozowski
  • Published in J. Autom. Lang. Comb. 26 July 2009
  • Mathematics
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is appropriate to define it in formal-language terms as the number of distinct quotients of the language, and to call it "quotient complexity". The problem of finding the quotient complexity of a language f(K,L) is considered, where K and L are regular… 

Figures from this paper


The quotient complexity of a regular language L, which is the same as its state complexity, is the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a

A Review on State Complexity of Individual Operations

This report reviews some of the results of state complexity of individual operations for regular and some subregular languages on the basis of subset construction and nondeterministic state complexity.

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages

Tight upper bounds are found on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of languages.

F L ] 2 3 M ay 2 01 5 Quotient Complexities of Atoms in Regular Ideal Languages ⋆

A (left) quotient of a language L by a word w is the language wL = {x | wx ∈ L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state complexity

Symmetric Groups and Quotient Complexity of Boolean Operations

The notion of uniform minimality to direct products of automata is generalized and the non-trivial connection between complexity of boolean operations and group theory is established.

Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms

It is proved that if a language has maximal syntactic complexity, then it has 2^n atoms and each atom has maximal quotient complexity, but the converse is false.

Syntactic Complexity of Regular Ideals

It is proved that nn−1, nn −1 + n − 1, and nn+2 + (n − 2)2n−2 + 1 are tight upper bounds on the syntactic complexities of right ideals and prefix- closed languages, left ideals and suffix-closed languages, and two-sided ideals and factor-closed Languages, respectively.

Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties

The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V of languages, a

Advanced Topics on State Complexity of Combined Operations

This thesis discusses the state complexities of individual operations on regular languages, including union, intersection, star, catenation, reversal and so on, and introduces the concept of estimation and approximation of state complexity.

Quotient Complexities of Atoms of Regular Languages

It is proved that, for any language L with quotients 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.



State Complexity of Prefix-Free Regular Languages

It is demonstrated that the state complexities of intersection and union operations based on the structural properties of prefix-free minimal DFAs can be reduced.

The State Complexities of Some Basic Operations on Regular Languages

State Complexity of Basic Operations on Finite Languages

It is shown that the catenation of two finite languages accepted by an m- state and an n-state DFA, respectively, with m > n is accepted by a DFA of (m - n + 3)2n-2 - 1 states in the two-letter alphabet case, and this bound is shown to be reachable.

On the state complexity of intersection of regular languages

A more general result is shown that given an arbitrary integer k > 0 and k nonnegative integers there exist k regular languages L 1 , L k such that L 1 is accepted by an n 1 -state DFA and any DFA accepting nl<i<k L i needs at least n l . . . nk states.

State complexity of cyclic shift

For 2- and 3-letter alphabets, it is proved 2 ⊖(n2) state complexity, and a tight 2n 2 + 1 lower bound is established for the nondeterministic state complexity of this operation using a binary alphabet.

Intersection of Regular Languages and State Complexity

In [1] B. Ravikumar considers the following problem. Given n languages L n (1) , L n (2) ,. . ., Ln (n) , each of which is recognized by a DFA with n states : what is the number of states of the

On the State Complexity of Complements, Stars, and Reversals of Regular Languages

The deterministic and nondeterministic state complexity of complements, stars, and reversals of regular languages are examined and an exponential number of values that are non-magic are obtained, which improves a similar result of Geffert.

Finite Automata, Digraph Connectivity, and Regular Expression Size

This work develops a different, more versatile lower bound technique that is based on the star height of regular languages, which is tied to cycle rank, a structural complexity measure for digraphs proposed by Eggan and Buchi, which measures the degree of connectivity of directed graphs.

Derivatives of Regular Expressions

In this paper the notion of a derivative of a regular expression is introduced atld the properties of derivatives are discussed and this leads, in a very natural way, to the construction of a state diagram from a regularexpression containing any number of logical operators.

Unary Language Operations, State Complexity and Jacobsthal's Function

This paper gives the cost, in terms of states, of some basic operations on regular languages in the unary case (where the alphabet contains only one symbol) by explicitly determining the number of states in the noncyclic and cyclic parts of the resulting automata.