3229 search results - page 28 / 646 » The Theory of Timed Automata |
COLT
1994
Springer
14 years 24 days ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
CONCUR
2006
Springer
14 years 13 days ago
2006
Springer
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
IPL
2007
13 years 8 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
CAV
1999
Springer
14 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
FUIN
2008
13 years 8 months ago
2008
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...