Syntactic Complexities of Some Classes of Star-Free Languages
| dc.contributor.author | Brzozowski, Janusz | |
| dc.contributor.author | Li, Baiyu | |
| dc.date.accessioned | 2017-09-29T14:03:06Z | |
| dc.date.available | 2017-09-29T14:03:06Z | |
| dc.date.issued | 2012 | |
| dc.description | The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-31623-4_9 | en |
| dc.description.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. | en |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada [OGP0000871] | en |
| dc.identifier.uri | http://dx.doi.org/10.1007/978-3-642-31623-4_9 | |
| dc.identifier.uri | http://hdl.handle.net/10012/12508 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.subject | finite automaton | en |
| dc.subject | monotonic | en |
| dc.subject | nearly monotonic | en |
| dc.subject | partially monotonic | en |
| dc.subject | star-free language | en |
| dc.subject | syntactic complexity | en |
| dc.subject | syntactic semigroup | en |
| dc.title | Syntactic Complexities of Some Classes of Star-Free Languages | en |
| dc.type | Conference Paper | en |
| dcterms.bibliographicCitation | Brzozowski, J., & Li, B. (2012). Syntactic Complexities of Some Classes of Star-Free Languages. In Descriptional Complexity of Formal Systems (pp. 117–129). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_9 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.typeOfResource | Text | en |