

cones
/koΚnz/


















noun
An object V together with an arrow going from V to each object of a diagram such that for any arrow A in the diagram, the pair of arrows from V which subtend A also commute with it. (Then V can be said to be the coneβs vertex and the diagram which the cone subtends can be said to be its base.)


noun
A set of formal languages with certain desirable closure properties, in particular those of the regular languages, the context-free languages and the recursively enumerable languages.







