SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES-Reference-Cited by-同舟云学术

SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES

Published:2014-11 Issue:07 Volume:25 Page:807-821
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

BRZOZOWSKI JANUSZ¹,LI BAIYU¹

Affiliation:

1. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada

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 ℛ- and 𝒥-trivial regular languages, respectively.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054114400097

Reference11 articles.

1. Languages of R-trivial monoids

2. Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages

3. On deterministic finite automata and syntactic monoid size

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Syntactic Complexity of Semi-flower Languages;Descriptional Complexity of Formal Systems;2019

2. On Syntactic Complexity of Circular Semi-flower Automata;Implementation and Application of Automata;2018

3. On Boolean combinations forming piecewise testable languages;Theoretical Computer Science;2017-06

4. Completely Reachable Automata;Descriptional Complexity of Formal Systems;2016