Formal Logic of Cellular Automata
-
Published:2021-06-15
Issue:2
Volume:30
Page:187-203
-
ISSN:0891-2513
-
Container-title:Complex Systems
-
language:
-
Short-container-title:ComplexSystems
Author:
Das Sukanta, ,Chakraborty Mihir K.,
Abstract
This paper develops a formal logic, named L CA , targeting modeling of one-dimensional binary cellular automata. We first develop the syntax of L CA , then give semantics to L CA in the domain of all binary strings. Then the elementary cellular automata and four-neighborhood binary cellular automata are shown as models of the logic. These instances point out that there are other models of L CA . Finally it is proved that any one-dimensional binary cellular automaton is a model of the proposed logic.
Publisher
Wolfram Research, Inc.
Subject
General Computer Science,Control and Systems Engineering