Brzozowski, JanuszSinnamon, Corwin2018-04-232018-04-232017-03-06https://doi.org/10.1007/978-3-319-53733-7_12http://hdl.handle.net/10012/13159The final publication is available at Springer via http://dx.doi.org/10.1007%2F978-3-319-53733-7_12A 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.enDifferent alphabetsLeft idealMost complexQuotient/state complexityRegular languageSuffix-closedSuffix-convexSuffix-freeSyntactic semigroupTransition semigroupUnrestricted complexityConference Paper