70 search results - page 7 / 14 » Polynomial Operators on Classes of Regular Languages |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
PPDP
2010
Springer
14 years 7 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
ICTAC
2007
Springer
15 years 3 months ago
2007
Springer
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
78
Voted
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
JMLR
2012
13 years 1 days ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...