A model of information confrontation based on a two-dimensional percolation-cellular automaton closed oriented surface is constructed and implemented programmatically. Numerical experiments were performed. theorem the finiteness completely positive topological entropy given cellular formulated proved. As an applied application automaton, retrospective forecast results Russian Presidential elect...

In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a computing unit, a sequential automaton is employed to describe some state transitions, a hierarchical automaton is employed to express the different granula...

We study the dynamic and complexity of generalized Q2R automaton. show existence non-polynomial cycles as well its capability to simulate with synchronous update classical version automaton updated under a block sequential scheme. Furthermore, we that decision problem consisting in determine if given node network changes state is P-Hard.

Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigroup be isomorphic to the input semigroup of its semigroup automaton, a necessary condition if the semigroup is finite. The left-discrimination sequence of an automaton is defined as a sequence of semigroups beginning with the input semigroup of the automaton, each member being the input semigroup o...

We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by Langton for his self-reproducing automaton, but provides the added advantage of being able to perform independent constructional and computational tasks alongside self-reproduction. Our automaton is capable, like Lang...

In this paper, at first, we define the notion of general fuzzy automaton over a field; call vector (VGFA). Moreover, present concept max-min automaton. We show that if two VGFA are similar, they constitute an isomorphism. After that, prove isomorphism with threshold α, equivalent where $\alpha \in [0,1]$. Also, some examples given to clarify these new notions.