Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.

Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts

Abstract: Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results.

Computing on a Simple Asynchronous Cellular Automaton

Abstract: An asynchronous cellular automaton (ACA) is a cellular automaton which allows cells to undergo state transitions independently at random timings. This paper gives an efficient scheme to compute on a special ACA model that takes a substantially simple transition function. This ACA has much less complexity as compared to other models with respect to the number of transition rules.

Asymmetric structure between two sets of adaptive agents: an approach using a matching automaton

Abstract: Using a matching automaton motivated by the Stable Marriage Problem (SMP), we discuss an adaptive behavior observed in audio sensory systems. The matching automaton with two disjoint sets of adaptive agents will adapt to the environment by using a degree of freedom in the automata. Further, we also discuss an asymmetry between the environment side and cognitive side which plays a critical role. When the diversity in the environment is lowered, the cognitive side is induced to adapt to the environment by reorganizing resources that were assigned to less important functions.

Constructing an automaton for exploring dynamic labyrinths

Abstract: A variety of interesting problems arise in the study of finite automata that move about in a two dimensional space. The model proposed by H. Muller [4] is used here to construct new automaton which can explore any labyrinth and escape through the moving or dynamic obstacles inside over the grid. The earlier results were shown for static obstacles distributed over integer grid and the automaton in this case was constructed to interact on the rectangular grid location endowed with four neighborhood directional states. In this paper we allow obstacles moving in discrete steps and verify that the finite automaton with just five printing symbols can escape or find the exit.