Show simple item record

dc.contributor.authorBrzozowski, Janusz
dc.contributor.authorSinnamon, Corwin 14:56:31 (GMT) 14:56:31 (GMT)
dc.descriptionThe final publication is available at Springer via http:/
dc.description.abstractA language L over an alphabet Σ is prefix-convex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were studied elsewhere. Here we concentrate on prefix-convex languages that do not belong to any one of these classes; we call such languages proper. We exhibit most complex proper prefix-convex languages, which meet the bounds for the size of the syntactic semigroup, reversal, complexity of atoms, star, product, and Boolean operations.en
dc.description.sponsorshipNatural Sciences and Engineering Research Council of Canada [grant no. OGP0000871]en
dc.relation.ispartofseriesPart of the Lecture Notes in Computer Science book series (LNCS, volume 10329)en
dc.subjectMost complexen
dc.subjectQuotient complexityen
dc.subjectRegular languageen
dc.subjectState complexityen
dc.subjectSyntactic semigroupen
dc.titleComplexity of Proper Prefix-Convex Regular Languagesen
dc.typeConference Paperen
dcterms.bibliographicCitationBrzozowski J.A., Sinnamon C. (2017) Complexity of Proper Prefix-Convex Regular Languages. In: Carayol A., Nicaud C. (eds) Implementation and Application of Automata. CIAA 2017. Lecture Notes in Computer Science, vol 10329. Springer, Chamen
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


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