Formal Definition
An alternating finite automaton (AFA) is a 6-tuple, where
- is a finite set of existential states. Also commonly represented as .
- is a finite set of universal states. Also commonly represented as .
- is a finite set of input symbols.
- is a set of transition functions to next state .
- is the initial (start) state, such that .
- is a set of accepting (final) states such that .
Read more about this topic: Alternating Finite Automaton
Famous quotes containing the words formal and/or definition:
“The manifestation of poetry in external life is formal perfection. True sentiment grows within, and art must represent internal phenomena externally.”
—Franz Grillparzer (1791–1872)
“... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.”
—George Eliot [Mary Ann (or Marian)
Related Phrases
Related Words