On the limit sets of cellular automata
SIAM Journal on Computing
Classifying circular cellular automata
Physica D
Cellular automata: theory and experiment
Cellular automata: theory and experiment
One-way cellular automata on Cayley graphs
Theoretical Computer Science
On the computational complexity of finite cellular automata
Journal of Computer and System Sciences
Finite automata-models for the investigation of dynamical systems
Information Processing Letters
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
Regular Article: On Acyclic Orientations and Sequential Dynamical Systems
Advances in Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the predictability of coupled automata: an allegory about chaos
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Hi-index | 0.00 |
We study herewith some aspects related to predictability of the long-term global behavior of the star topology based infrastructures when all the nodes, including the central node, are assumed to function reliably, faultlessly and synchronously. In particular, we use the nonlinear complex systems concepts and methodology, coupled with those of computational complexity, to show that, simple as the star topology is, determining and predicting the longterm global behavior of the star-based infrastructures are computationally challenging tasks. More formally, determining various configuration space properties of the appropriate star network abstractions is shown to be hard in general. We particularly focus herein on the computational (in)tractability of counting the "fixed point" configurations of a class of formal discrete dynamical systems defined over the star interconnection topology.