e/Cone (formal languages)

Information
has gloss	eng: In formal language theory, a cone is a set of formal languages that has some desirable closure properties enjoyed by some well-known sets of languages, in particular by the families of regular languages, context-free languages and the recursive languages . The concept of a cone is a more abstract notion that subsumes all of these families.
lexicalization	eng: cone
instance of	e/Formal language