555 search results - page 4 / 111 » Complexity of Operations on Cofinite Languages |
DLT
2007
13 years 9 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
AGTIVE
2007
Springer
14 years 1 months ago
2007
Springer
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
CONEXT
2010
ACM
13 years 4 months ago
2010
ACM
Abstract-- Network management and operations are complicated, tedious, and error-prone, requiring significant human involvement and domain knowledge. As the complexity involved ine...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
ACTA
2002
13 years 7 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...