Theory of Computation (Automata)
Identify the correct concept described as: a finite automaton that may have multiple possible transitions for a given state and input symbol.
- A. Non-deterministic finite automaton (NFA) ✓
- B. Context-free grammar
- C. Halting problem
- D. Chomsky hierarchy
Correct answer
A. Non-deterministic finite automaton (NFA)
Explanation
Non-deterministic finite automaton (NFA) refers to a finite automaton that may have multiple possible transitions for a given state and input symbol.