Diddy: a Python toolbox for infinite discrete dynamical systems

DOI10.1007/978-3-031-42250-8_3MaRDI QIDQ6435029zbMATH OpenOpenAlexFDO

Authors Ville Salo, Ilkka A. Törmä

Publication date 2 May 2023

Full work available at URL https://doi.org/10.1007/978-3-031-42250-8_3

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Abstract: We introduce Diddy, a collection of Python scripts for analyzing infinite discrete dynamical systems. The main focus is on generalized multidimensional shifts of finite type (SFTs). We show how Diddy can be used to easily define SFTs and cellular automata, and analyze their basic properties. We also showcase how to verify or rediscover some results from coding theory and cellular automata theory.

Recommendations

• On the dynamics and recursive properties of multidimensional symbolic systems
• CAPD::DynSys: a flexible C++ toolbox for rigorous numerical analysis of dynamical systems
• Exploring discrete dynamics
• SageMath tools for stability and bifurcation for discrete dynamical systems
• Computing with dynamical systems

Cited in

(2)

• Multidimensional tilings and MSO logic
• Avoshifts

This page was built for publication: Diddy: a Python toolbox for infinite discrete dynamical systems

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