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
26 Jun 2009
TL;DR: An algorithm of the behavior of a finite automation in a stationary random medium with binary reactions is proposed to solve the problem of expedient behavior of the considered automation.
Abstract: An algorithm of the behavior of a finite automation in a stationary random medium with binary reactions is proposed. The problem of expedient behavior of the considered automation is studied by the methods of the random walk theory and the conditions are obtained under which its behavior in a stationary random medium is expedient.
01 Jan 1991
TL;DR: In this article, the behavior of cellular automata with local transition rule 90 was studied. But the authors were mainly concerned with cellular automaton with fixed points and the order of configurations.
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].
01 Jan 2005
TL;DR: This thesis describes the design and implementation of a tool for constraint automata consisting of an editor and three simulators, which allows users to visually construct and modify constraint automaton.
Abstract: The coordination language Reo offers a flexible framework for compositionally constructing software systems out of components through connectors. These connectors not only connect components with each other, but also exogenously coordinate the interactions between them. The connectors themselves are compositionally built out of simpler connectors, where the simplest connectors are a set of user-defined channels with well-defined behavior. Formal semantics can be given to Reo using constraint automata and timed data streams. Constraint automata can be seen as an extension of the finite automata, where the language accepted by an automaton is specified by using timed data streams. In this thesis we describe the design and implementation of a tool for constraint automata consisting of an editor and three simulators. The constraint automata editor allows users to visually construct and modify constraint automata. The first simulator for constraint automata acts as a language acceptor of timed data streams. The second one simulates a constraint automaton as a Reo connector where the input is defined as timed data streams. The third simulator simulates a constraint automaton as a Reo connector where components are attached to. These components deliver the input at real-time instead of using predefined timed data streams
TL;DR: Bounded cellular automata process recognition of languages faster than one-way automata, and are shown to be able to be used for graph processing.
Abstract: Advancement of VLSI technology accelerates studies in parallel computation. These are studies of such parallel algorithms as recognition of language, sorting, matrix calculations and graph processing, of one-way cellular automata (systolic arrays), iterative arrays, tree structure cell automata, and bounded cellular automata, etc., the goal of which is to devise simpler and faster networks. So far, systolic arrays have attracted considerable attention from theoretical as well as practical viewpoints. On the other hand, bounded cellular automata seemingly have not stimulated much interest. This paper shows that bounded cellular automata process recognition of languages faster than one-way automata.