67 search results - page 8 / 14 » The Expressiveness of a Family of Finite Set Languages |
ICS
2009
Tsinghua U.
14 years 2 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
JMLR
2010
13 years 2 months ago
2010
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
FCS
2006
13 years 9 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...