Show simple item record

dc.contributor.authorBrzozowski, Janusz
dc.contributor.authorLi, Baiyu
dc.contributor.authorYe, Yuli
dc.date.accessioned2017-11-13 22:52:27 (GMT)
dc.date.available2017-11-13 22:52:27 (GMT)
dc.date.issued2012-08-31
dc.identifier.urihttp://dx.doi.org/10.1016/j.tcs.2012.04.011
dc.identifier.urihttp://hdl.handle.net/10012/12622
dc.descriptionThe final publication is available at Elsevier via http://dx.doi.org/10.1016/j.tcs.2012.04.011 © 2012. 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.abstractThe syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We prove that n(n-2) is a tight upper bound for prefix-free regular languages. We present properties of the syntactic semigroups of suffix-, bifix-, and factor-free regular languages, conjecture tight upper bounds on their size to be (n-1)(n-2) + (n-2), (n - 1)(n-3) + (n - 2)(n-3) + (n - 3)(n-3), and (n - 1)(n-3) + (n - 3)2(n-3) + 1, respectively, and exhibit languages with these syntactic complexities. (C) 2012 Elsevier B.V. All rights reserved.en
dc.description.sponsorshipNatural Sciences and Engineering Research Council of Canada [OGP0000871]en
dc.description.sponsorshipDepartment of Computer Science, University of Torontoen
dc.language.isoenen
dc.publisherElsevieren
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectBifix-freeen
dc.subjectFactor-freeen
dc.subjectFinite automatonen
dc.subjectMonoiden
dc.subjectPrefix-freeen
dc.subjectRegular languageen
dc.subjectReversalen
dc.subjectSemigroupen
dc.subjectSuffix-freeen
dc.subjectSyntactic complexityen
dc.titleSyntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languagesen
dc.typeArticleen
dcterms.bibliographicCitationBrzozowski, J., Li, B., & Ye, Y. (2012). Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theoretical Computer Science, 449(Supplement C), 37–53. https://doi.org/10.1016/j.tcs.2012.04.011en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2David R. Cheriton School of Computer Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen


Files in this item

Thumbnail
Thumbnail

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

UWSpace

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