Diddy: a Python toolbox for infinite discrete dynamical systems

05/02/2023
by   Ville Salo, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2017

Ergodicity of some classes of cellular automata subject to noise

Cellular automata (CA) are dynamical systems on symbolic configurations ...
research
07/19/2019

Integrality of matrices, finiteness of matrix semigroups, and dynamics of linear cellular automata

Let K be a finite commutative ring, and let L be a commutative K-algebra...
research
02/20/2021

A Python Framework for Fast Modelling and Simulation of Cellular Nonlinear Networks and other Finite-difference Time-domain Systems

This paper introduces and evaluates a freely available cellular nonlinea...
research
10/14/2019

Some remarks on the performance of Matlab, Python and Octave in simulating dynamical systems

Matlab has been considered as a leader computational platform for many e...
research
09/09/2018

Cellular automata as convolutional neural networks

Deep learning techniques have recently demonstrated broad success in pre...
research
12/25/2021

Algorithmic Information Dynamics of Cellular Automata

We illustrate an application of Algorithmic Information Dynamics to Cell...
research
10/20/2022

Factorisation in the semiring of finite dynamical systems

Finite dynamical systems (FDSs) are commonly used to model systems with ...

Please sign up or login with your details

Forgot password? Click here to reset