Complexity of local, global and universality properties in finite dynamical systems

DOI10.1007/978-3-031-13502-6_1OpenAlexW4290017184MaRDI QIDQ2104128

Enrico Formenti

Publication date: 9 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-13502-6_1

zbMATH Keywords

computational complexityuniversality(Finite) discrete dynamical systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of reachability problems for finite discrete dynamical systems
• A multisecret sharing scheme for color images based on cellular automata
• On the complexity of occurrence and convergence problems in reaction systems
• From additive flowers to additive automata networks
• Complexity of fixed point counting problems in Boolean networks
• Complexity of the dynamics of reaction systems
• Fungal Automata

This page was built for publication: Complexity of local, global and universality properties in finite dynamical systems