Abstract
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function of the state complexity n of these languages. We study the syntactic complexity of three subclasses of star-free languages. We find tight upper bounds for languages accepted by monotonic, partially monotonic and "nearly monotonic" automata; all three of these classes are star-free. We conjecture that the bound for nearly monotonic languages is also a tight upper bound for star-free languages. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Brzozowski, J., & Li, B. (2012). Syntactic complexities of some classes of star-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 117–129). https://doi.org/10.1007/978-3-642-31623-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
