Resting potential

From formulasearchengine
Revision as of 16:32, 6 December 2013 by en>Tryptofish (Undid revision 584837955 by 137.43.182.163 (talk) correct spelling, verified by Google search)
Jump to navigation Jump to search

In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal transitions. For example, let A be an alternating automaton.

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 non-deterministic finite automaton (NFA) by performing a similar kind of powerset construction as it is used for the transformation of an NFA to a deterministic finite automaton (DFA). This construction converts an AFA with k states to an NFA with up to 2k states.

An alternative model which is frequently used is the one where Boolean combinations are represented as clauses. For instance, one could assume the combinations to be in Disjunctive Normal Form so that {{q1},{q2,q3}} would represent q1(q2q3). The state tt (true) is represented by {{}} in this case and ff (false) by . This clause representation is usually more efficient.

Formal Definition

An alternating finite automaton (AFA) is a 6-tuple, (S(),S(),Σ,δ,P0,F), where

References

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534


Template:Comp-sci-theory-stub