SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES
2014 ◽
Vol 25
(07)
◽
pp. 807-821
◽
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 ℛ- and 𝒥-trivial regular languages, respectively.
2005 ◽
Vol 16
(03)
◽
pp. 511-529
◽
Keyword(s):
2019 ◽
Vol 30
(06n07)
◽
pp. 921-957
2016 ◽
Vol 610
◽
pp. 91-107
◽
2019 ◽
Vol 30
(06n07)
◽
pp. 1197-1216
Keyword(s):
2019 ◽
Vol 30
(06n07)
◽
pp. 1117-1134
Keyword(s):
2020 ◽
pp. 1-20
Keyword(s):
2015 ◽
Vol 26
(02)
◽
pp. 211-227
◽