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: C. a transducer whose output depends only on the current state
Explanation:
Moore machine is correctly described as a transducer whose output depends only on the current state.
Choose an option to check your answer.
Correct Answer: D. a grammar variable that can be replaced using productions
Explanation:
non-terminal symbol is correctly described as a grammar variable that can be replaced using productions.
Choose an option to check your answer.
Correct Answer: B. a tool used to prove some languages are not regular
Explanation:
In this course context, pumping lemma for regular languages means a tool used to prove some languages are not regular.
Choose an option to check your answer.
Correct Answer: D. a transducer whose output depends only on the current state
Explanation:
In this course context, Moore machine means a transducer whose output depends only on the current state.
Choose an option to check your answer.
Correct Answer: A. a grammar variable that can be replaced using productions
Explanation:
In this course context, non-terminal symbol means a grammar variable that can be replaced using productions.
Choose an option to check your answer.
Correct Answer: B. a tool used to prove some languages are not regular
Explanation:
The suitable explanation is a tool used to prove some languages are not regular.
Choose an option to check your answer.
Correct Answer: C. a transducer whose output depends only on the current state
Explanation:
The suitable explanation is a transducer whose output depends only on the current state.
Choose an option to check your answer.
Correct Answer: B. a grammar variable that can be replaced using productions
Explanation:
The suitable explanation is a grammar variable that can be replaced using productions.
Choose an option to check your answer.
Correct Answer: D. a language that cannot be accepted by any finite automaton
Explanation:
The correct answer is a language that cannot be accepted by any finite automaton.
Choose an option to check your answer.
Correct Answer: B. a transducer whose output depends on current state and input symbol
Explanation:
The correct answer is a transducer whose output depends on current state and input symbol.
Choose an option to check your answer.
Correct Answer: B. a rule that describes how grammar symbols may be rewritten
Explanation:
The correct answer is a rule that describes how grammar symbols may be rewritten.
Choose an option to check your answer.
Correct Answer: B. a language that cannot be accepted by any finite automaton
Explanation:
non-regular language is correctly described as a language that cannot be accepted by any finite automaton.
