  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.
