Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
We present several extensions to our Lean–based formal mechanized framework for computing with cellular automata (CA). First we extend the definition of CAs to allow for specification of arbitrary boundary conditions. We use this addition to represent constant and periodic boundaries. We then formulate and prove numerous missing properties pertaining to canonical forms of cellular automata, culminating in a theorem stating that canonical forms preserve counts of nonempty cell states.