Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+ All Title Author Keywords Abstract
 Publish in OALib Journal ISSN: 2333-9721 APC: Only \$99

 Relative Articles Quotient Complexities of Atoms in Regular Ideal Languages The maximal free rational quotient Quotient Complexities of Atoms of Regular Languages Quotient Complexity of Star-Free Languages Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages Syntactic Complexity of Star-Free Languages On maximal tensor products and quotient maps of operator systems Syntactic Monoids in a Category On the ？ojasiewicz exponent, special direction and maximal polar quotient Syntactic Complexity of R- and J-Trivial Regular Languages More...

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

 Full-Text   Cite this paper

Abstract:

We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is isomorphic to the semigroup of transformations of states induced by non-empty words in the minimal deterministic finite automaton accepting the language. If the language has n left quotients (its minimal automaton has n states), then its syntactic complexity is at most n^n and this bound is tight. The second measure consists of the quotient (state) complexities of the atoms of the language, where atoms are non-empty intersections of complemented and uncomplemented quotients. A regular language has at most 2^n atoms and this bound is tight. The maximal quotient complexity of any atom with r complemented quotients is 2^n-1, if r=0 or r=n, and 1+\sum_{k=1}^{r} \sum_{h=k+1}^{k+n-r} \binom{h}{n} \binom{k}{h}, otherwise. We prove 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.

Full-Text 