Complexity of Prefix-Convex Regular Languages [article]

Janusz Brzozowski, Corwin Sinnamon
2016 arXiv   pre-print
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. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal, the size of the syntactic semigroup, and the quotient complexity of atoms. For binary operations we
more » ... arguments with different alphabets when appropriate; this leads to higher tight upper bounds than those obtained with equal alphabets. We exhibit most complex prefix-convex languages that meet the complexity bounds for all the measures listed above.
arXiv:1605.06697v3 fatcat:mfgvafwe7nctbkfgnrkw7jesda