EXTENDING LEAN CELLULAR AUTOMATA FRAMEWORK – BOUNDARY CONDITIONS AND PROPERTIES OF CANONICAL FORMS
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 form...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2020-05-01
|
| Series: | Acta Electrotechnica et Informatica |
| Subjects: | |
| Online Access: | http://www.aei.tuke.sk/papers/2020/1/5_Silvasi.pdf |