1246 search results - page 95 / 250 » Recursive Timed Automata |
96
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
88
Voted
CIT
2006
Springer
15 years 4 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
118
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
101
click to vote
HYBRID
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...