2467 search results - page 141 / 494 » Finite State Machines |
237
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
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...
173
click to vote
ORL
2008
15 years 6 months ago
2008
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
188
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
180
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.