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 formal Washington dinner party has all the spontaneity of a Japanese imperial funeral.”
—Simon Hoggart (b. 1946)
“The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.”
—William James (1842–1910)
Related Phrases
Related Words