Nondeterministic Finite Automaton

GPTKB entity

Predicate	Object
gptkbp:instanceOf	gptkb:Technical_Machine gptkb:Mathematical_model
gptkbp:abbreviation	gptkb:NFA
gptkbp:acceptsLanguage	Regular language
gptkbp:category	gptkb:Finite_automata
gptkbp:closureProperties	Closed under Kleene star Closed under concatenation Closed under union
gptkbp:complexity	Can be exponentially more succinct than DFA
gptkbp:conversionAlgorithm	Subset construction
gptkbp:convertedTo	gptkb:Deterministic_Finite_Automaton
gptkbp:equivalentTo	gptkb:Deterministic_Finite_Automaton
gptkbp:formalDefinition	5-tuple (Q, Σ, δ, q0, F)
gptkbp:hasAcceptStates	Set of accept states
gptkbp:hasEpsilonTransitions	May have epsilon transitions
gptkbp:hasInputAlphabet	Finite input alphabet
gptkbp:hasStartState	Start state
gptkbp:hasStateSet	Finite set of states
gptkbp:hasTransitionFunction	Transition function
gptkbp:introduced	gptkb:Dana_Scott gptkb:Michael_O._Rabin
gptkbp:introducedIn	1959
gptkbp:minimization	Equivalent to DFA minimization
gptkbp:recognizedBy	Regular expressions
gptkbp:stateTransition	Non-deterministic
gptkbp:transitionFunctionType	May have multiple possible next states
gptkbp:usedIn	gptkb:Automata_theory gptkb:Formal_language_theory Computer science
gptkbp:bfsParent	gptkb:Deterministic_Finite_Automaton
gptkbp:bfsLayer	7
https://www.w3.org/2000/01/rdf-schema#label	Nondeterministic Finite Automaton