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 decision problem for which no algorithm halts with correct yes/no answers for all inputs
Explanation:
The suitable explanation is a decision problem for which no algorithm halts with correct yes/no answers for all inputs.
Choose an option to check your answer.
Correct Answer: D. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
The correct answer is NFAs and DFAs recognize exactly the class of regular languages.
Choose an option to check your answer.
Correct Answer: A. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
equivalence of NFA and DFA is correctly described as NFAs and DFAs recognize exactly the class of regular languages.
Choose an option to check your answer.
Correct Answer: C. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
In this course context, equivalence of NFA and DFA means NFAs and DFAs recognize exactly the class of regular languages.
Choose an option to check your answer.
Correct Answer: B. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
The suitable explanation is NFAs and DFAs recognize exactly the class of regular languages.
Choose an option to check your answer.
Correct Answer: C. a Turing machine that can simulate other Turing machines from their encodings
Explanation:
The correct answer is a Turing machine that can simulate other Turing machines from their encodings.
Choose an option to check your answer.
Correct Answer: B. regular expressions and finite automata describe the same class of regular languages
Explanation:
The correct answer is regular expressions and finite automata describe the same class of regular languages.
Choose an option to check your answer.
Correct Answer: C. a Turing machine that can simulate other Turing machines from their encodings
Explanation:
Universal Turing Machine is correctly described as a Turing machine that can simulate other Turing machines from their encodings.
Choose an option to check your answer.
Correct Answer: C. regular expressions and finite automata describe the same class of regular languages
Explanation:
equivalence of RE and FA is correctly described as regular expressions and finite automata describe the same class of regular languages.
Choose an option to check your answer.
Correct Answer: A. a Turing machine that can simulate other Turing machines from their encodings
Explanation:
In this course context, Universal Turing Machine means a Turing machine that can simulate other Turing machines from their encodings.
Choose an option to check your answer.
Correct Answer: D. regular expressions and finite automata describe the same class of regular languages
Explanation:
In this course context, equivalence of RE and FA means regular expressions and finite automata describe the same class of regular languages.
Choose an option to check your answer.
Correct Answer: B. a Turing machine that can simulate other Turing machines from their encodings
Explanation:
The suitable explanation is a Turing machine that can simulate other Turing machines from their encodings.
