Complexity of proper prefix-convex regular languages
| dc.contributor.author | Brzozowski, Janusz | |
| dc.contributor.author | Sinnamon, Corwin | |
| dc.date.accessioned | 2020-03-18T16:06:50Z | |
| dc.date.available | 2020-03-18T16:06:50Z | |
| dc.date.issued | 2019-10-01 | |
| dc.description | The final publication is available at Elsevier via https://doi.org/10.1016/j.tcs.2018.07.015. © 2018. 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.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 | This work was supported by the Natural Sciences and Engineering Research Council of Canada grant No. OGP0000871. | en |
| dc.identifier.uri | https://doi.org/10.1016/j.tcs.2018.07.015 | |
| dc.identifier.uri | http://hdl.handle.net/10012/15697 | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| 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 | Article | en |
| dcterms.bibliographicCitation | J.A. Brzozowski, C. Sinnamon, Complexity of proper prefix-convex regular languages, Theoret. Comput. Sci. (2018), https://doi.org/10.1016/j.tcs.2018.07.015 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 1-s2.0-S0003267018313047-main.pdf
- Size:
- 614.75 KB
- Format:
- Adobe Portable Document Format
- Description:
- Accepted manuscript
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 4.47 KB
- Format:
- Item-specific license agreed upon to submission
- Description: