Sciweavers

11 search results - page 1 / 3
» Addition-Invariant FO and Regularity
Sort
View
LICS
2010
IEEE
13 years 3 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
ANCS
2009
ACM
13 years 2 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
STACS
2009
Springer
13 years 11 months ago
The Dynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
FSTTCS
2010
Springer
13 years 2 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
ICIP
2009
IEEE
14 years 5 months ago
Wavelet-based Parallel Mri Regularization Using Bivariate Sparsity Promoting Priors
Parallel magnetic resonance imaging (pMRI) using multiple receiver coils has emerged as a powerful 3D imaging technique for reducing scanning time or increasing image resolution. ...