Program verifying solution formulae for ternary CA induced by semigroups
| dc.contributor.author | Henryk Fukś | |
| dc.date.accessioned | 2025-06-04T15:56:35Z | |
| dc.date.available | 2025-06-04T15:56:35Z | |
| dc.date.issued | 2025-06-04 | |
| dc.description | This program produces spatio-temporal patterns for any of the 18 ternary CA rules induced by semigroups. User needs only to change the number in the line "rule=number", the number must be 1 to 18. Numbers are the same as in the paper "Ternary cellular automata induced by semigroups of order 3 are solvable". The output consists of three pictures: (1) pattern generated by the CA rule by normal iterations; (2) the same pattern generated from the solution formula; (3) the difference between them (should be empty - all white). | |
| dc.description.abstract | Program for verifying solution formulae for 18 cellular automata induced by semigroups, as listed in the paper "Ternary cellular automata induced by semigroups of order 3 are solvable", Proceedings of AUTOMATA 2025. | |
| dc.identifier.uri | https://hdl.handle.net/10464/19421 | |
| dc.language.iso | en | |
| dc.rights | Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | MATHEMATICS | |
| dc.title | Program verifying solution formulae for ternary CA induced by semigroups | |
| dc.type | Software |