Complexity of Proper Prefix-Convex Regular Languages
A language L over an alphabet \(\varSigma \) is prefix-convex if, for any words \(x,y,z\in \varSigma ^*\), 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.
KeywordsAtom Most complex Prefix-convex Proper Quotient complexity Regular language State complexity Syntactic semigroup
- 7.Brzozowski, J.A., Sinnamon, C.: Complexity of prefix-convex regular languages (2016). http://arxiv.org/abs/1605.06697
- 8.Brzozowski, J.A., Sinnamon, C.: Complexity of right-ideal, prefix-closed, and prefix-free regular languages. Acta Cybernet. (2017, to appear)Google Scholar
- 16.Thierrin, G.: Convex languages. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 481–492. North-Holland (1973)Google Scholar