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

Self-Description for Construction and Computation on Graph-Rewriting Automata

Abstract: This article shows how self-description can be realized for construction and computation in a single framework of a variant of graph-rewriting systems called graph-rewriting automata. Graph-rewriting automata define symbol dynamics on graphs, in contrast to cellular automata on lattice space. Structural change is possible along with state transition. Self-replication based on a self-description is shown as an example of self-description for construction. This process is performed using a construction arm, which is realized as a subgraph, that executes a program described in the graph structure. In addition, a metanode structure is introduced to embed rule sets in the graph structure as self-description for computation. These are regarded as universal graph-rewriting automata that can serve as a model of systems that maintain themselves through replication and modification.

On vector trajectory specifications for multi-agent product systems

Abstract: The prescription of sets of trajectories for a finite deterministic automaton A is formulated via the notion of specifications denoted, both individually and collectively, by SPEC. Necessary and sufficient conditions for the existence of sets of trajectories satisfying a given SPEC are provided. The formulation and specification of structures for interacting automata are developed within the multi-agent (MA) product framework and the associated MA product of specifications (MSPEC) is introduced.

Polylinear Sequential Circuit Realizations of Finite Automata

Abstract: —This paper considers the problem of obtaining realizations of synchronous finite automata from their regular expression specifications. A polylinear sequential circuit realization is defined, and it is proven that every synchronous finite automaton has such a realization. A method is developed for the derivation of a polylinear sequential circuit realization of any automaton specified by a regular expression. The method uses a derivative approach and is applied to the reverse of the given regular expression. As a by-product of developing the method, a connection between the state assigmnent problem and regular expressions is established. Another by-product is a simple method for obtaining polylinear sequential circuit realizations of automata specified by flow tables instead of regular expressions.

A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata

Abstract: In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic finite automata (MADFAs). Such automata represent finite languages and are therefore useful in applications such as storing words for spell-checking, computer and biological virus searching, text indexing and XML tag lookup. In such applications, the automata can grow extremely large (with more than 10 6 states) and are difficult to store without compression or minimization. The taxonomization method arrives at all of the known algorithms, and some which are likely new ones (though proper attribution is not always possible, since the algorithms are usually of commercial value and some secrecy frequently surrounds the identities of the original authors).