Topic
Mobile automaton
About: Mobile automaton is a research topic. Over the lifetime, 2160 publications have been published within this topic receiving 63192 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This paper demonstrates that in several cases the endmarkers are unnecessary in that a class of automata with end markers recognizes only languages that are recognizable by the analogous classes of automaton without one or both of the end markers.
Abstract: This paper is written by automata theorists for automata theorists. In numerous definitions of automata, there is an "input head" which is expected to be positioned at one square of an "input tape" at all times. There is often the possibility that the automaton might cause the input head to move right, say, from the rightmost input square, before theautomaton has had a chance to do all the computation it wanted to do. Thus, "endmarkers"—special symbols that appear on the leftmost and rightmost input squares but are not otherwise considered part of the input-are often part of the automaton definition. This paper demonstrates that in several cases the endmarkers are unnecessary in that a class of automata with end markers recognizes only languages that are recognizable by the analogous classes of automata without one or both of the endmarkers.
01 Jan 2009
TL;DR: It is proved that for every integer k ‚ 1, two-way alternating kpebble automata and one-way deterministic k-pebbles automata for data languages have the same recognition power.
Abstract: We prove that for every integer k ‚ 1, two-way alternating kpebble automata and one-way deterministic k-pebble automata for data languages have the same recognition power.
TL;DR: This work decomposes the Automata into pieces and uses OpenMp to parallelize the process, and results show that using a decomposition procedure, and distributing the mesh between a set of processors, 3D Cellular Automata can be studied without having long execution times.
Abstract: This paper describes our research on using Genetic Programming to obtain transition rules for Cellular Automata, which are one type of massively parallel computing system. Our purpose is to determine the existence of a limit of chaos for three dimensional Cellular Automata, empirically demonstrated for the two dimensional case. To do so, we must study statistical properties of 3D Cellular Automata over long simulation periods. When dealing with big three dimensional meshes, applying the transition rule to the whole structure can become a extremely slow task. In this work we decompose the Automata into pieces and use OpenMp to parallelize the process. Results show that using a decomposition procedure, and distributing the mesh between a set of processors, 3D Cellular Automata can be studied without having long execution times.
TL;DR: The paired synchronized automataproduced by the proposed decomposition method are much simpler than the automata produced by the previous method, and they are easy to be translated in a program.
Abstract: We propose a method of decomposing an automaton which represents the flow of a program into simpler automata. More specifically, we: (1) introduce a new automata model called paired synchronized automata; (2) present a polynomial time algorithm for decomposing an automaton into paired synchronized automata; (3) show the correctness proof of the algorithm; and (A) give an experimental result on the effect of the decomposition algorithm for a certain application. In the proposed model of paired synchronized automata, each automaton contains a synchronization symbol to describe the action of sending a signal to and receiving it from another automaton, and for any external input, multiple transitions are prohibited. The paired synchronized automata produced by the proposed decomposition method are much simpler than the automata produced by the previous method, and they are easy to be translated in a program.