Classifying circular cellular automata
Physica D
Cellular automata: theory and experiment
Cellular automata: theory and experiment
The complexity of processing hierarchical specifications
SIAM Journal on Computing
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the computational complexity of finite cellular automata
Journal of Computer and System Sciences
Elements of a theory of computer simulation I: sequential CA over random graphs
Applied Mathematics and Computation
Elements of a theory of simulation II: sequential dynamical systems
Applied Mathematics and Computation
Discrete, sequential dynamical systems
Discrete Mathematics
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On the time and tape complexity of languages.
On the time and tape complexity of languages.
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science
| Hi-index | 0.01 |
Informally, a sequential dynamical system (SDS) consists of an undirected graph where each node v is associated with a state sv and a transition function fv. Given the state value sv and those of the neighbors of v, the function fv computes the next value of sv. Theno de transition functions are evaluated according to a specified total order. Such a computing device is a mathematical abstraction of a simulation system. We address the complexity of some state reachability problems for SDSs. Our main result is a dichotomy between classes of SDSs for which the state reachability problems arecomp utationally intractablean d those for which the problems are efficiently solvable. These results also allow us to obtain stronger lower bounds on the complexity of reachability problems for cellular automata and communicating state machines.