Accueil >                  	Term: nondeterministic finite automaton  
nondeterministic finite automaton
A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states. The transition function also may map the null symbol (no input symbol needed) and states to next states.
- Partie du discours : noun
 - Secteur d’activité/Domaine : Informatique
 - Catégorie : Algorithms & data structures
 - Government Agency: NIST
 
 			0   			 		
 Créateur
- GeorgeV
 - 100% positive feedback