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 条
  • [41] Concatenation of Regular Languages and Descriptional Complexity
    Galina Jirásková
    Theory of Computing Systems, 2011, 49 : 306 - 318
  • [42] Complexity of topological properties of regular ω-languages
    Selivanov, Victor L.
    Wagner, Klaus W.
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : 197 - 217
  • [43] THE COMPLEXITY OF REGULAR DNLC GRAPH LANGUAGES
    AALBERSBERG, IJ
    ENGELFRIET, J
    ROZENBERG, G
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 40 (03) : 376 - 404
  • [44] RESTRICTING THE COMPLEXITY OF REGULAR DNLC LANGUAGES
    AALBERSBERG, IJ
    ENGELFRIET, J
    ROZENBERG, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 291 : 147 - 166
  • [45] Concatenation of Regular Languages and Descriptional Complexity
    Jiraskova, Galina
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (02) : 306 - 318
  • [46] Boolean Circuit Complexity of Regular Languages
    Valdats, Maris
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 342 - 354
  • [47] Complexity of Topological Properties of Regular ω-Languages
    Selivanov, Victor L.
    Wagner, Klaus W.
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 529 - +
  • [48] Can chunking reduce syntactic complexity of natural languages?
    Lu, Qian
    Xu, Chunshan
    Liu, Haitao
    COMPLEXITY, 2016, 21 (S2) : 33 - 41
  • [49] COMPLEXITY OF SKEWLINEAR TUPLE LANGUAGES AND O-REGULAR LANGUAGES
    KUICH, W
    INFORMATION AND CONTROL, 1971, 19 (04): : 353 - &
  • [50] Complexity in Union-Free Regular Languages
    Jiraskova, Galina
    Masopust, Tomas
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 255 - +
12345