Assertion: cone | /r/HasProperty | a set of formal languages
Facets:
value: in formal language theory
type: OTHER
Source sentences:
text: 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 recursively enumerable languages.