124 search results - page 19 / 25 » Antichain Algorithms for Finite Automata |
CONCUR
2009
Springer
14 years 1 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
AAAI
1996
13 years 8 months ago
1996
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
ITICSE
2004
ACM
14 years 23 days ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...