62 search results - page 5 / 13 » On the Expressiveness and Complexity of Randomization in Fin... |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
With the increasing complexity of information systems, it is becoming increasingly unclear as to how information system behaviors relate to stated requirements. Although requireme...
SIAMAM
2000
13 years 7 months ago
2000
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...