ω-automaton
In automata theory, a branch of theoretical computer science, an Ordinal number, ω-automaton (or stream automaton) is a variation of a finite automaton that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states. ω-automata are useful for specifying behavior of systems that are not expected to terminate, such as hardware, operating systems and control systems. For such systems, one may want to specify a property such as "for every request, an acknowledge eventually follows", or its negation "there is a request that is not followed by an acknowledge". The former is a property of infinite words: one cannot say of a finite sequence that it satisfies this property. Classes of ω-automata include the Büchi automaton, Büchi automata, Rabin automata, Streett automata, parity automata and Muller automaton, Muller automata, each deterministic or non-deterministic. T ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]