Continuous automaton

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

Study on self-organization of modular self-reconfigurable robot based on cellular automata

Abstract: The modular Self-Reconfigurable Robots were constructed by many each other dependently intelligence entity called “cell”, the tasks have been finished through connection and separation between the cells to form different movement and the shape. The cellular automaton extremely suits to the imitate nature biology evolution process, this paper using the advantages whose neighboring of cellular automaton were mutually sensation and local action, transition rules were independently produced through the genetic algorithm, not having artificially to interfere and code, thus the distributional realization of modular self-reconfigurable robots were realized. Independence production of the transition rules reduced intensity of the code, it provides the foundation to further studied the communication of distributional control and the load of distribution

A canonical automaton for one-rule length-preserving string rewrite systems

Abstract: In this work, we use rearrangements in rewriting positions sequence in order to study precisely the structure of the derivations in one-rule length-preserving string rewrite systems. That yields to the definition of a letter-to-letter transducer that computes the relation induced by a one-rule length-preserving string rewrite system. This transducer can be seen as an automaton over an alphabet A × A . We prove that this automaton is finite if and only if the corresponding relation is rational. We also identify a sufficient condition for the context-freeness of the language L recognized by this automaton and, when this condition is satisfied, we construct a pushdown automaton that recognizes L.

Approximate Equivalence of the Hybrid Automata with Taylor Theory

Abstract: Hybrid automaton is a formal model for precisely describing a hybrid system in which the computational processes interact with the physical ones. The reachability analysis of the polynomial hybrid automaton is decidable, which makes the Taylor approximation of a hybrid automaton applicable and valuable. In this paper, we studied the simulation relation among the hybrid automaton and its Taylor approximation, as well as the approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybrid automata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.