Asynchronous, finite dynamical systems

DOI10.1007/S11047-023-09944-3MaRDI QIDQ6535742zbMATH OpenFDO

Authors Henning S. Mortveit

Publication date 9 February 2024

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11047-023-09944-3

zbMATH Keywords

acyclic orientationsasynchronousBoolean networksfinite dynamical systemsschedulingstructure-to-function theory

Mathematics Subject Classification ID

Combinatorial dynamics (types of periodic orbits) (37E15) Dynamical systems involving maps of trees and graphs (37E25) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Cycle equivalence of graph dynamical systems
• Cycle equivalence of finite dynamical systems containing symmetries
• On acyclic orientations and sequential dynamical systems
• Discrete, sequential dynamical systems
• Combinatorics of sequential dynamical systems

Cites work

• \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
• A guided tour of asynchronous cellular automata
• A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
• Acyclic orientations of random graphs
• An atlas of limit set dynamics for asynchronous elementary cellular automata
• An introduction to sequential dynamical systems
• Attractor stability in finite asynchronous biological system models
• Block invariance in elementary cellular automata
• Classes of cycle bases
• Combinatorial problems of commutation and rearrangements
• Combinatorics on update digraphs in Boolean networks
• Complexity of reachability problems for finite discrete dynamical systems
• Conjugacy of Coxeter elements.
• Conjugacy relation on Coxeter elements
• Cycle equivalence of graph dynamical systems
• Discrete, sequential dynamical systems
• Dynamics groups of asynchronous cellular automata
• Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 7385036 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 5215428 (Why is no real title available?)
• Lipschitz continuity under toric equivalence for asynchronous Boolean networks
• Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
• On enumeration of conjugacy classes of Coxeter elements
• On the computational complexity of the Jones and Tutte polynomials
• Order Independence in Asynchronous Cellular Automata
• Posets from admissible Coxeter sequences.
• Syzygies of oriented matroids
• Toric partial orders

This page was built for publication: Asynchronous, finite dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535742)