SYNTACTIC COMPLEXITY OF R- AND J-TRIVIAL REGULAR LANGUAGES
被引:3
|
作者:
Brzozowski, Janusz
论文数: 0引用数: 0
h-index: 0
机构:
Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, CanadaUniv Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
Brzozowski, Janusz
[1
]
Li, Baiyu
论文数: 0引用数: 0
h-index: 0
机构:
Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, CanadaUniv Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
Li, Baiyu
[1
]
机构:
[1] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
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.
机构:
Nova Southeastern Univ, Dept Math, 3301 Coll Ave, Ft Lauderdale, FL 33314 USANova Southeastern Univ, Dept Math, 3301 Coll Ave, Ft Lauderdale, FL 33314 USA
Lee, Edmond W. H.
Rhodes, John
论文数: 0引用数: 0
h-index: 0
机构:
Univ Calif Berkeley, Dept Math, 970 Evans Hall 3840, Berkeley, CA 94720 USANova Southeastern Univ, Dept Math, 3301 Coll Ave, Ft Lauderdale, FL 33314 USA
Rhodes, John
Steinberg, Benjamin
论文数: 0引用数: 0
h-index: 0
机构:
CUNY City Coll, Dept Math, NAC 8-133,Convent Ave & 138th St, New York, NY 10031 USANova Southeastern Univ, Dept Math, 3301 Coll Ave, Ft Lauderdale, FL 33314 USA
Steinberg, Benjamin
RENDICONTI DEL SEMINARIO MATEMATICO DELLA UNIVERSITA DI PADOVA,
2022,
147
: 43
-
78