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

DOI10.1007/978-3-031-13502-6_1MaRDI QIDQ2104128zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1070886 (Why is no real title available?)
• A multisecret sharing scheme for color images based on cellular automata
• Complexity of fixed point counting problems in Boolean networks
• Complexity of reachability problems for finite discrete dynamical systems
• Complexity of the dynamics of reaction systems
• Descriptive complexity: a logician's approach to computation.
• From additive flowers to additive automata networks
• Fungal automata
• Handbook of product graphs
• On the complexity of occurrence and convergence problems in reaction systems

Cited in

(3)

• Complexity for extended dynamical systems
• Global and local complexity in weakly chaotic dynamical systems
• scientific article; zbMATH DE number 5233906 (Why is no real title available?)

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

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