402 search results - page 14 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
ICALP
2009
Springer
14 years 7 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...
ICANN
2009
Springer
14 years 2 months ago
2009
Springer
Model complexity is key concern to any artificial learning system due its critical impact on generalization. However, EC research has only focused phenotype structural complexity ...
DRM
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...