Topic
ω-automaton
About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper decides the behaviour of cellular automata, including the existence of fixed points and the order of configurations, using the poly nomial representation of configurations with respect to a basis derived from a series of state transition.
Abstract: This paper decides the behaviour of cellular automata, including the existence of fixed points and the order of configurations, using the poly nomial representation of configurations with respect to a basis derived from a series of state transition. We are mainly concerned with cellular automata with local transition rule 90 since the method described here can be used for any finite cellular automata with a little alternations [7].
7 citations
••
01 Jan 1994TL;DR: An on-line and decentralized path-planning algorithm for multiple automata and its deadlock-free characteristic in an infinite 2-d world is proposed and discussed.
Abstract: In this paper, we propose an on-line and decentralized path-planning algorithm for multiple automata and then discuss its deadlock-free characteristic in an infinite 2-d world. In this research, we consider many automata with a finite number in the world without any static obstacle. Each automaton with the same circular shape can move for omni-directions to arrive at the goal. An automaton basically does not see any information except its present position in an on-line manner, and therefore usually goes straight to the goal and finally stops at it. However an automaton exceptionally knows a behavior of another colliding one by its ring of tactile sensors, and in a real time way, it processes the present own and partner’s behaviors to determine its next own behavior by the common sense.
7 citations
••
25 Feb 1993TL;DR: A decision procedure is shown and an algorithm is given which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.
Abstract: The problem of completing a finite automata preserving its properties is here investigated in the case of deterministic local automata. We show a decision procedure and give an algorithm which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.
7 citations