Diddy: a Python toolbox for infinite discrete dynamical systems

2023/05/02 by Salo, Ville, Törmä, Ilkka · 1 citation
#37-04 #Discrete Mathematics (cs.DM) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Software (cs.MS)

paper · doi:10.48550/arxiv.2305.01375

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.

Cited by

• Multidimensional tilings and MSO logic

Related

• Cellular Automata Using Infinite Computations
• Classification of Discrete Dynamical Systems Based on Transients
• Mathematical Physics of Cellular Automata
• Universal Analog Computation: Fraïssé Limits of Dynamical Systems
• An Algorithmic Pipeline for Solving Equations over Discrete Dynamical Systems Modelling Hypothesis on Real Phenomena