Alternating finite automaton
In automata theory, an alternating finite automaton (AFA) is a non-deterministic finite automaton whose transitions are divided into existential and universal transitions. Let A be an alternating automaton.
- For a transition <math>(q, a, q_1 \vee q_2)<math>, A nondeterministically chooses to switch the state to either <math>q_1<math> or <math>q_2<math>, reading a.
- For a transition <math>(q, a, q_1 \wedge q_2)<math>, A moves to <math>q_1<math> and <math>q_2<math>, reading a.
Note that due to the universal quantification a run is represented by a run tree. A accepts a word w, if there exists a run tree on w such that every path ends in an accepting state.
A basic theorem tells that any AFA is equivalent to an NFA by performing a similar kind of powerset construction as it is used for the transformation of NFA to DFA. This construction converts an AFA with n states to a NFA with up to <math>2^k<math> states.
This article is a stub. You can help BambooWeb by .
