Commutativity of Composition of some Elementary Cellular Automata on Monoids
| Autor: | Shuichi Inokuchi, Toshikazu Ishida |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Pure mathematics
Computer science Existential quantification 010102 general mathematics Binary number 0102 computer and information sciences Nonlinear Sciences::Cellular Automata and Lattice Gases Propositional calculus 01 natural sciences Cellular automaton Reversible cellular automaton Elementary cellular automaton 010201 computation theory & mathematics Computer Science::Logic in Computer Science Multiplication 0101 mathematics Commutative property Computer Science::Formal Languages and Automata Theory |
| Zdroj: | CANDAR |
| DOI: | 10.1109/candar51075.2020.00024 |
| Popis: | The local function of a cellular automaton with binary states can be expressed by a formula in propositional logic. If it is of a reversible cellular automaton, its inverse transition function can also be expressed by some formula in propositional logic, and there exists a cellular automaton defined by it as a local function. The local function of the composition of two cellular automata can be created by multiplication of these formulae in propositional logic.In this paper, we deal with logical formulae on a commutative monoid as local functions of elementary cellular automata. We discuss the commutativity of multiplication of formulae and show some condition for formulae to satisfy the commutativity of the composition of some elementary cellular automata. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|