nondeterministic finite automaton

URI: https://gptkb.org/entity/nondeterministic_finite_automaton
GPTKB entity
Statements (33)
Predicate Object
gptkbp:instanceOf gptkb:Technical_Machine
gptkbp:abbreviation gptkb:NFA
gptkbp:allows regular language
gptkbp:closed gptkb:Kleene_star
gptkb:intersection
gptkb:Union
complementation
concatenation
gptkbp:computationalPower same as deterministic finite automaton
gptkbp:contrastsWith gptkb:deterministic_finite_automaton
gptkbp:convertedTo gptkb:deterministic_finite_automaton
gptkbp:describedBy "Finite Automata and Their Decision Problems"
gptkbp:field gptkb:theoretical_computer_science
automata theory
gptkbp:hasAcceptStates set of accept states
gptkbp:hasEpsilonTransition yes
gptkbp:hasInputAlphabet input alphabet
gptkbp:hasStartState start state
gptkbp:hasTransition multiple possible next states
gptkbp:hasTransitionFunction transition function
gptkbp:includesState set of states
gptkbp:introduced gptkb:Dana_Scott
gptkb:Michael_O._Rabin
gptkbp:introducedIn 1959
gptkbp:minimization not always unique
gptkbp:stateExplosion conversion to DFA may cause exponential growth
gptkbp:usedIn lexical analysis
pattern matching
regular expression matching
gptkbp:bfsParent gptkb:Rabin–Scott_automata
gptkb:finite_automata
gptkbp:bfsLayer 6
https://www.w3.org/2000/01/rdf-schema#label nondeterministic finite automaton