| dc.contributor.author | Brzozowski, Janusz | |
| dc.contributor.author | Sinnamon, Corwin | |
| dc.date.accessioned | 2018-04-23 14:56:31 (GMT) | |
| dc.date.available | 2018-04-23 14:56:31 (GMT) | |
| dc.date.issued | 2017-06-27 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-319-60134-2_5 | |
| dc.identifier.uri | http://hdl.handle.net/10012/13158 | |
| dc.description | The final publication is available at Springer via http:/dx.doi.org/10.1007/978-3-319-60134-2_5 | en |
| dc.description.abstract | A 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.sponsorship | Natural Sciences and Engineering Research Council of Canada [grant no. OGP0000871] | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Part of the Lecture Notes in Computer Science book series (LNCS, volume 10329) | en |
| dc.subject | Atom | en |
| dc.subject | Most complex | en |
| dc.subject | Prefix-convex | en |
| dc.subject | Proper | en |
| dc.subject | Quotient complexity | en |
| dc.subject | Regular language | en |
| dc.subject | State complexity | en |
| dc.subject | Syntactic semigroup | en |
| dc.title | Complexity of Proper Prefix-Convex Regular Languages | en |
| dc.type | Conference Paper | en |
| dcterms.bibliographicCitation | Brzozowski 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, Cham | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
