Syntactic Complexity Of R- And J-Trivial Regular Languages
MetadataShow full item record
The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We prove that n! and [e(n - 1)!] are tight upper bounds for the syntactic complexity of R- and J-trivial regular languages, respectively.
Cite this version of the work
Janusz Brzozowski, Baiyu Li (2014). Syntactic Complexity Of R- And J-Trivial Regular Languages. UWSpace. http://hdl.handle.net/10012/12509