620 search results - page 69 / 124 » Algorithms and computations on cellular automata |
134
click to vote
SIGCSE
2004
ACM
15 years 11 months ago
2004
ACM
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
138
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
163
click to vote
FPL
1999
Springer
15 years 10 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
179
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
187
click to vote
SASO
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract— On the one hand, natural phenomena of spontaneous pattern formation are generally random and repetitive, whereas, on the other hand, complicated heterogeneous architect...