Show simple item record

dc.contributor.authorBrzozowski, Janusz
dc.contributor.authorSzykuła, Marek 14:08:54 (GMT) 14:08:54 (GMT)
dc.descriptionThe final publication is available at Elsevier via © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license
dc.description.abstractWe 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.sponsorshipNatural Sciences and Engineering Research Council of Canada (NSERC) grant No. OGP000087en
dc.description.sponsorshipNational Science Centre, Poland project number 2014/15/B/ST6/00615en
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.subjectMost complexen
dc.subjectRegular languageen
dc.subjectState complexityen
dc.subjectSyntactic complexityen
dc.subjectTransition semigroupen
dc.titleComplexity of Suffix-Free Regular Languagesen
dcterms.bibliographicCitationBrzozowski, J. A., & Szykuła, M. (2017). Complexity of suffix-free regular languages. Journal of Computer and System Sciences, 89(Supplement C), 270–287.
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2David R. Cheriton School of Computer Scienceen

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 International
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages