Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs

Authors:
Deqiang Chen;Jie Zheng;Xiaoqian Wu
Affiliations:
College of Information Technology and Science, Nankai University, Tianjin, P.R. China 300071;Department of Applied Mathematics, Donghua University, Shanghai, P.R. China 201620;Department of Applied Mathematics, Donghua University, Shanghai, P.R. China 201620
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 6
Cited 0

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
Regular Article: On Acyclic Orientations and Sequential Dynamical Systems

Advances in Applied Mathematics
ETS IV: sequential dynamical systems: fixed points, invertibility and equivalence

Applied Mathematics and Computation
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discrete dynamical systems based on dependency digraphs play an important role in the mathematical theory of computer simulation. In this paper, we are concerned with word-updating dynamical systems (WDS) on digraphs, which is a generalization of sequential dynamical systems (SDS) on graphs defined by Barrett et al. By defining an equivalence relation, we obtain the number of different WDS for the given dependency digraph and local functions. It is shown that WDS with the NOR function are closely related to combinatorial properties of the dependency digraphs.