SYNTACTIC COMPLEXITY OF R- AND J-TRIVIAL REGULAR LANGUAGES

被引：3
|
作者：
Brzozowski, Janusz [1 ]
Li, Baiyu [1 ]
机构：
[1] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2014年 / 25卷 / 07期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Finite automaton; J-trivial; monoid; regular language; R-trivial; semigroup; syntactic complexity;
D O I：
10.1142/S0129054114400097
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：807 / 821
页数：15
相关论文
共 50 条
12345