Abstract
We define here the counterpart of Jensen convex and anti-convex sets of real numbers for the case of languages. We investigate the existence of languages consisting only of strings in which a set of symbols is convex or anti-convex, as well as the place of such languages in Chomsky hierarchy. Local convexity is also briefly investigated.
*Corresponding author
*Corresponding author
Notes
*Corresponding author