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.
Author supplied keywords
Cite
CITATION STYLE
Brzozowski, J. A., & Sinnamon, C. (2017). Complexity of proper prefix-convex regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10329 LNCS, pp. 52–63). Springer Verlag. https://doi.org/10.1007/978-3-319-60134-2_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
