Elements of a theory of simulation. III: Equivalence of SDS.
From MaRDI portal
Publication:1855031
DOI10.1016/S0096-3003(00)00042-4zbMath1050.68161OpenAlexW2027223427MaRDI QIDQ1855031
Christian M. Reidys, Christopher L. Barrett, Henning S. Mortveit
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(00)00042-4
Related Items (40)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ A new discrete dynamical system of signed integer partitions ⋮ Computation of functions on \(n\) bits by asynchronous clocking of cellular automata ⋮ The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Discrete dynamical systems on graphs and Boolean functions ⋮ On the dynamics of semilattice networks ⋮ Linear sequential dynamical systems, incidence algebras, and Möbius functions ⋮ Parallel and sequential dynamics of two discrete models of signed integer partitions ⋮ Complexity of reachability problems for finite discrete dynamical systems ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Parallel discrete dynamical systems on maxterm and minterm Boolean functions ⋮ Dependency and accuracy measures for directed graphs ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Decomposition and simulation of sequential dynamical systems ⋮ Parallel dynamical systems over directed dependency graphs ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Agent-Based Modeling, Mathematical Formalism for ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions ⋮ Updating method for the computation of orbits in parallel and sequential dynamical systems ⋮ Parallel dynamical systems over special digraph classes ⋮ Dichotomy results for fixed point counting in Boolean dynamical systems ⋮ Equivalence relations on finite dynamical systems ⋮ Matrix method for linear sequential dynamical systems on digraphs ⋮ Sequential dynamical systems over words ⋮ Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems ⋮ Update schedules of sequential dynamical systems ⋮ Dynamical attraction in parallel network models ⋮ Flexible toggles and symmetric invertible asynchronous elementary cellular automata ⋮ ON ASYNCHRONOUS CELLULAR AUTOMATA ⋮ On periods and equilibria of computational sequential systems ⋮ Limit Set Reachability in Asynchronous Graph Dynamical Systems ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ Elements of a theory of simulation. II: Sequential dynamical systems. ⋮ ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS ⋮ Cycle Equivalence of Finite Dynamical Systems Containing Symmetries ⋮ Parallel dynamical systems over graphs and related topics: a survey ⋮ ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence ⋮ A graph-dynamical interpretation of Kiselman's semigroups ⋮ Attractors and transient in sequential dynamical systems
Cites Work
This page was built for publication: Elements of a theory of simulation. III: Equivalence of SDS.
