555 search results - page 10 / 111 » Complexity of Operations on Cofinite Languages |
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
CSL
2000
Springer
13 years 11 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
MODELS
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...