Syntactic Complexity Of R- And J-Trivial Regular Languages
Loading...
Date
2014-11-01
Authors
Brzozowski, Janusz
Li, Baiyu
Journal Title
Journal ISSN
Volume Title
Publisher
World Scientific Publishing
Abstract
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.
Description
Electronic version of an article published as International Journal of Foundations of Computer Science, 25(07), 2014, 807–821. http://dx.doi.org/10.1142/S0129054114400097 © World Scientific Publishing Company http://www.worldscientific.com/
Keywords
Finite automaton, J-trivial, monoid, regular language, R-trivial, semigroup, syntactic complexity