Automata Systems Research Articles

Some regular state sets in the system of one-dimensional iterative automata

For the system of one-dimensional iterative automata, each set of all passive, Garden-of-Eden, and branching point state configurations is defined and shown to constitute a regular set. This regularity is proved to hold for the fixed, cyclic, open and reflexive boundary conditions. For proving theorems, a new device called N-automaton is introduced. Relationship with the gsm mapping is also discussed.

Metrically complete systems of automata

Metrically complete systems of automata

Decomposition theory for automata and biological systems

Decomposition theory for automata and biological systems

A simulation language for modeling of biological cells

The simulation of self-reproduction in systems of automata and biological cells is a promising technique for the study of biological self-organization. A special-purpose compiler (Cellular List-Processing Program, clpp) has been written in SDS-920 machine language and used for models of this type. The present report deals with the technical details of this simulation language. It may be described as a very simplified list-processing technique, without capacity for any complex logical manipulation of words, but possessing restricted arithmetic capability. A cell is represented entirely by lists of pre-assigned fixed words or elements, with associated numerical values and indicator bits. The program operators, such as on, add, check, list check, print, etc., allow convenient representation of gene-enzyme activities in a simplified model cell. A table describes the program operators and a short sample program is presented. Two flowcharts deal with compilation of the machine program and execution of several typical program instructions. There is a brief comparison of clpp with more general list-processing languages. It is concluded that special-purpose simulators will be of value for machine studies of complex models of cells, tissues, and morphogenesis.

Limit behavior of a closed system of automata with random input

Limit behavior of a closed system of automata with random input