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

Partially ordered classes of finite automata

Abstract: This paper is concerned with the algebraic structure of classes of automata, rather than single automata, with respect to several relations on these classes: certain equivalence relations like isomorphism and having identical semigroups, and certain partial order relations like being a homomorphic image or a subautomaton of another automaton. Several classes of automata are found to be lattices under certain partial orders.

On a class of automata models of learning machines

Abstract: A class of machines modelled as deterministic Moore automata is proposed. Particular attention is given to investigating their capability of exhibiting learning behaviour assessed by an associated index of performance. This is done by assuming that the automata are operating in a random environment about which they have no a priori knowledge.

Size Reduction of Multitape Automata

Abstract: We present a method for size reduction of two-way multitape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a single state. Our work is motivated by implementation of a language for string manipulation in database systems where string predicates are compiled into two-way multitape automata. Additionally, we present a (one-tape) NFA reduction algorithm that is based on a method proposed for DFA minimization by Kameda and Weiner, and apply this algorithm, combined with the multitape automata reduction algorithm, on our multitape automata.

Theorems on additive automata

Abstract: Publisher Summary This chapter discusses theorems on additive automata. The theory of linear automata is well developed, and many works have appeared on this topic. To every given automaton, there belongs a unique minimal one, which is a homomorpic image of it. The minimal automaton, belonging to a linear automaton over a field K, is again a linear automaton over the same field. The chapter discusses whether the minimal automaton belonging to an additive automaton is again additive with the same operator sets. Many well-known results on linear automata can be generalized to additive automata. The chapter describes the necessary and sufficient conditions for the (H,K)-realizability of an automaton M.

A Symmetric Nine-State Automaton for the Generalized Firing Synchronization Problem

Abstract: The firing synchronization problem was introduced by J.Myhill in 1957. The problem concerns a one-dimensional array of finite automata. The length of the array of automata is denoted by n. All automata are identical except for the ones on the end, one of which is the initiator for the synchronization. The goal is to define the set of states and transition rules for the automata so that all machines enter a special fire state for the first time and simultaneously at some time t(n). The generalized firing synchronization problem was introduced in 1968 by F.R. Moore and G.G. Langdon. This problem differs from the original firing synchronization problem in that the initiator of the synchronization can be located anywhere in the array. The generalized problem requires time 2n-k-2, where n is the number of automata in the array and k is the distance from the initiator to the nearest end of the array. H. Szwerinski, using ideas similar to Moore and Langdon''s, produced a ten-state, minimal-time, symmetric solution. We improve on that automaton to produce the first known nine-state, time-optimal, symmetric solution.