Complexity of Suffix-Free Regular Languages
| dc.contributor.author | Brzozowski, Janusz | |
| dc.contributor.author | Szykuła, Marek | |
| dc.date.accessioned | 2017-09-28 14:08:54 (GMT) | |
| dc.date.available | 2017-09-28 14:08:54 (GMT) | |
| dc.date.issued | 2017-11-01 | |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.jcss.2017.05.011 | |
| dc.identifier.uri | http://hdl.handle.net/10012/12497 | |
| dc.description | The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.jcss.2017.05.011 © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| dc.description.abstract | We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the complexity upper bounds for all basic measures. It is known that there exist such most complex sequences in several classes of regular languages. In contrast to this, we prove that there does not exist a most complex sequence in the class of suffix-free regular languages. However, we do exhibit two such sequences that together meet upper bounds for all basic measures. | en |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada (NSERC) grant No. OGP000087 | en |
| dc.description.sponsorship | National Science Centre, Poland project number 2014/15/B/ST6/00615 | en |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | Most complex | en |
| dc.subject | Regular language | en |
| dc.subject | State complexity | en |
| dc.subject | Suffix-Free | en |
| dc.subject | Syntactic complexity | en |
| dc.subject | Transition semigroup | en |
| dc.title | Complexity of Suffix-Free Regular Languages | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Brzozowski, J. A., & Szykuła, M. (2017). Complexity of suffix-free regular languages. Journal of Computer and System Sciences, 89(Supplement C), 270–287. https://doi.org/10.1016/j.jcss.2017.05.011 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International