MCQ Collection
Theory of Automata & Formal Languages MCQs
MCQs on automata theory, grammars, regular languages, and formal language concepts.
Choose an option to check your answer.
Correct Answer: A. a language for which some Turing machine halts on every input and decides membership
Explanation:
The correct answer is a language for which some Turing machine halts on every input and decides membership.
Choose an option to check your answer.
Correct Answer: C. input is accepted when the stack becomes empty under the acceptance rules
Explanation:
PDA acceptance by empty stack is correctly described as input is accepted when the stack becomes empty under the acceptance rules.
Choose an option to check your answer.
Correct Answer: D. a production of the form A -> B where both are non-terminals
Explanation:
unit production is correctly described as a production of the form A -> B where both are non-terminals.
Choose an option to check your answer.
Correct Answer: C. a language for which some Turing machine halts on every input and decides membership
Explanation:
decidable language is correctly described as a language for which some Turing machine halts on every input and decides membership.
Choose an option to check your answer.
Correct Answer: B. input is accepted when the stack becomes empty under the acceptance rules
Explanation:
In this course context, PDA acceptance by empty stack means input is accepted when the stack becomes empty under the acceptance rules.
Choose an option to check your answer.
Correct Answer: D. a production of the form A -> B where both are non-terminals
Explanation:
In this course context, unit production means a production of the form A -> B where both are non-terminals.
Choose an option to check your answer.
Correct Answer: D. a language for which some Turing machine halts on every input and decides membership
Explanation:
In this course context, decidable language means a language for which some Turing machine halts on every input and decides membership.
Choose an option to check your answer.
Correct Answer: B. input is accepted when the stack becomes empty under the acceptance rules
Explanation:
The suitable explanation is input is accepted when the stack becomes empty under the acceptance rules.
Choose an option to check your answer.
Correct Answer: D. a production of the form A -> B where both are non-terminals
Explanation:
The suitable explanation is a production of the form A -> B where both are non-terminals.
Choose an option to check your answer.
Correct Answer: D. a language for which some Turing machine halts on every input and decides membership
Explanation:
The suitable explanation is a language for which some Turing machine halts on every input and decides membership.
Choose an option to check your answer.
Correct Answer: A. removing useless, unreachable, or non-generating symbols and unnecessary productions
Explanation:
The correct answer is removing useless, unreachable, or non-generating symbols and unnecessary productions.
Choose an option to check your answer.
Correct Answer: D. a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling
Explanation:
The correct answer is a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling.
