ω-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.

CAME&L – Cellular Automata Modeling Environment & Library

Abstract: New software for distributed parallel computations is presented. It is desired to be universal, easy-to-use, featureful and extensible workspace for cellular automata studying and complicated scientific computations. The idea is to represent each automaton by the set of components of four types (grid, datum, metrics and rules). Either of types is to implement its own part of functionality and combining allows to build different automata for arbitrary tasks. Class of systems that could be modeled with the help of introduced project is even wider than “cellular automata”. Project has rather long list of features and abilities, which mark it out the set of existing software of this kind.

From equivalence to almost-equivalence, and beyond: minimizing automata with errors

Abstract: We introduce E-equivalence, which is a straightforward generalization of almost-equivalence. While almost-equivalence asks for ordinary equivalence up to a finite number of exceptions, in E-equival...

A succinct canonical register automaton model for data domains with binary relations

Abstract: We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register automata. A major contribution is a construction of succinct canonical register automata, which is parameterized on the set of relations by which elements in the data domain can be compared. We also present a Myhill Nerode-like theorem, from which minimal canonical automata can be constructed. This canonical form is as expressive as general deterministic register automata, but much better suited for modeling in practice since we lift many of the restrictions on the way variables can be accesed and stored: this allows our automata to be significantly more succinct than previously proposed canonical forms. Key to the canonical form is a symbolic treatment of data languages, which allows us to construct minimal representations whenever the set of relations can be equipped with a so-called branching framework.

Finite automata and morphisms in assisted musical composition

Abstract: Finite automata originated in computer science and linguistics. They have applications in mathematics and physics and they have already been used in assisted musical composition. In this article we show how finite automata (or more generally locally catenative formulas) underlie the structure of the Formulas for String Quartet of Tom Johnson.

Matrix approach to stabilizability of deterministic finite automata

Abstract: This paper investigates the state feedback stabilizing problem of deterministic finite automata using a matrix approach. With the help of semi-tensor product, a matrix-based expression for finite automata is given, and the dynamics of automata are expressed in the form of a discrete-time bilinear equation. After providing the notions of equilibrium and cycle stability, we give necessary and sufficient algebraic conditions for the stabilizability of deterministic finite automata for the two respective cases. Then, based on the matrix expression, we focus on a special case where the controlled state trajectories to the target equilibrium is minimal. All the state feedback controllers can be obtained by solving a matrix inequality. Examples are also given for illustration.