UWSpace staff members will be away from May 5th to 9th, 2025. We will not be responding to emails during this time. If there are any urgent issues, please contact GSPA at gsrecord@uwaterloo.ca. If any login or authentication issues arise during this time, please wait until UWSpace Staff members return on May 12th for support.
 

Syntactic Complexities of Some Classes of Star-Free Languages

Thumbnail Image

Files

BrzozowskiLi_SynStarFree_r-s.pdf (175.82 KB)

Date

2012

Authors

Brzozowski, Janusz
Li, Baiyu

Advisor

Journal Title

Journal ISSN

Volume Title

Publisher

Springer

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.

Description

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-31623-4_9

Keywords

finite automaton, monotonic, nearly monotonic, partially monotonic, star-free language, syntactic complexity, syntactic semigroup

LC Subject Headings

Citation

URI

http://dx.doi.org/10.1007/978-3-642-31623-4_9
 http://hdl.handle.net/10012/12508

Collections

Waterloo Research
Computer Science