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.
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) question asks: Identify the correct concept described as: a finite automaton that may have multiple possible transitions for a given state and input symbol. The correct choice is A. Non-deterministic finite automaton (NFA). Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Theory of Computation (Automata) items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Theory of Computation (Automata) so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Theory of Computation (Automata) item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Non-deterministic finite automaton (NFA) ✓
- B. Context-free grammar
Why not B: “Context-free grammar” does not fit this question. The answer is Non-deterministic finite automaton (NFA).
- C. Halting problem
Why not C: “Halting problem” does not fit this question. The answer is Non-deterministic finite automaton (NFA).
- D. Chomsky hierarchy
Why not D: “Chomsky hierarchy” does not fit this question. The answer is Non-deterministic finite automaton (NFA).
Correct answer
A. Non-deterministic finite automaton (NFA)
Explanation
Non-deterministic finite automaton (NFA) (option A) is the accepted answer to “Identify the correct concept described as: a finite automaton that may have multiple possible transitions for a given state and input symbol.”. Option B (Context-free grammar) does not fit this question. Option C (Halting problem) does not fit this question. Option D (Chomsky hierarchy) does not fit this question. For this Theory of Computation (Automata) question, the accepted answer is Non-deterministic finite automaton (NFA).
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- What is the name for a finite automaton where each state has exactly one transition for each possible input sy...
- A sequence of characters that defines a search pattern, corresponding to regular languages. What is this conce...
- What does Finite automaton refer to?
- Choose the correct description of Regular expression.
- Which term refers to an abstract machine with a finite number of states used to recognize patterns in input st...
- Which of the following best names the concept in which an automaton that uses a stack to recognize context-fre...