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

A Decision Procedure for Computations of Finite Automata

Abstract: The "computed output sequence" of a finite automaton is defined as the sequence which results from the output sequence when all occurrences of a special output symbol X are deleted. A "computation pair" consists of an input sequence and the resultant computed output sequence, and the "computation" of a n automaton is the set of all its computation pairs. The class of infinite computations is broader than the class of behaviors of finite automata. Burks has therefore raised the question of the existence of a decision procedure to determine if two automata have the same computation. In this paper, such a decision procedure is given.

Construction of Distributed Systems from Cycle-Free Finite Automata

Abstract: The purpose of this paper is to introduce an algorithm to construct distributed systems from cycle-free finite automata and a partition of the input-alphabet.

Reset Sequences for Finite Automata with Application to Design of Parts Orienters

Abstract: Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in faster asymptotic time than Natarajan's algorithms, and in addition finds the shortest possible reset sequence if such a sequence exists. We give tight bounds on the length of the minimum reset sequence. We further improve the time and space bounds of another algorithm given by Natarajan, which finds reset sequences for arbitrary deterministic finite automata when all states are initially possible.