Skip to search formSkip to main contentSkip to account menu

Cone (formal languages)

Known as: Cone (disambiguation), Trio, Trio (formal languages) 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Nonnegative tensor factorization has applications in statistics, computer vision, exploratory multiway data analysis, and blind… 
2012
2012
Relational particle mechanics models bolster the relational side of the absolute versus relational motion debate, and are… 
Highly Cited
2002
2002
2002
By replacing ten-dimensional pure spinors with eleven-dimensional pure spinors, the formalism recently developed for covariantly… 
Highly Cited
2001
Highly Cited
2001
Given a manifoldB with conical singularities, we consider the cone algebra with discrete asymptotics, introduced by Schulze, on a… 
Highly Cited
1998
Highly Cited
1998
In 1995 and 1996, researchers associated with the US Air Force’s Phillips and Armstrong Laboratories took part in an extensive… 
Highly Cited
1996
Highly Cited
1996
Abstract Abstract. Parental effort by socially monogamous purple martins was measured to test the hypothesis that males reduce… 
Highly Cited
1988
Highly Cited
1988
A fast, efficient, algorithm that processes polyhedral cones from views of an object to produce an octree representation of the… 
Highly Cited
1979
Highly Cited
1979
We study the set of admissible (Pareto-optimal) points of a closed, convex setX when preferences are described by a convex, but…