Jump to content

Alternating finite automaton

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gdr (talk | contribs) at 10:58, 4 July 2004 (Basic definition). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In automata theory, an alternating automaton is a non-deterministic finite automata whose states are divided into existential and universal states. An alternating automaton in an existential state accepts if some transition leads to acceptance; and in a universal state accepts if every transition leads to acceptance.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Alternating_finite_automaton&oldid=4435261"