Show simple item record

dc.contributor.authorBrzozowski, Janusz
dc.contributor.authorSinnamon, Corwin 15:35:33 (GMT) 15:35:33 (GMT)
dc.descriptionThe final publication is available at Springer via
dc.description.abstractA language L over an alphabet Σ is suffix-convex if, for any words x,y,z∈Σ∗, whenever z and xyz are in L, then so is yz. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free languages. We examine complexity properties of these three special classes of suffix-convex regular languages. In particular, we study the quotient/state complexity of boolean operations, product (concatenation), star, and reversal on these languages, as well as the size of their syntactic semigroups, and the quotient complexity of their atoms.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 10168)en
dc.subjectDifferent alphabetsen
dc.subjectLeft idealen
dc.subjectMost complexen
dc.subjectQuotient/state complexityen
dc.subjectRegular languageen
dc.subjectSyntactic semigroupen
dc.subjectTransition semigroupen
dc.subjectUnrestricted complexityen
dc.titleComplexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languagesen
dc.typeConference Paperen
dcterms.bibliographicCitationBrzozowski J.A., Sinnamon C. (2017) Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. In: Drewes F., Martín-Vide C., Truthe B. (eds) Language and Automata Theory and Applications. LATA 2017. Lecture Notes in Computer Science, vol 10168. 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