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: D. an automaton that produces output while processing input
Explanation:
transducer is correctly described as an automaton that produces output while processing input.
Choose an option to check your answer.
Correct Answer: D. a symbol that appears in final strings generated by a grammar
Explanation:
terminal symbol is correctly described as a symbol that appears in final strings generated by a grammar.
Choose an option to check your answer.
Correct Answer: C. the complement of a regular language is regular
Explanation:
In this course context, regular languages closed under complement means the complement of a regular language is regular.
Choose an option to check your answer.
Correct Answer: D. an automaton that produces output while processing input
Explanation:
In this course context, transducer means an automaton that produces output while processing input.
Choose an option to check your answer.
Correct Answer: A. a symbol that appears in final strings generated by a grammar
Explanation:
In this course context, terminal symbol means a symbol that appears in final strings generated by a grammar.
Choose an option to check your answer.
Correct Answer: D. the complement of a regular language is regular
Explanation:
The suitable explanation is the complement of a regular language is regular.
Choose an option to check your answer.
Correct Answer: C. an automaton that produces output while processing input
Explanation:
The suitable explanation is an automaton that produces output while processing input.
Choose an option to check your answer.
Correct Answer: D. a symbol that appears in final strings generated by a grammar
Explanation:
The suitable explanation is a symbol that appears in final strings generated by a grammar.
Choose an option to check your answer.
Correct Answer: C. a tool used to prove some languages are not regular
Explanation:
The correct answer is a tool used to prove some languages are not regular.
Choose an option to check your answer.
Correct Answer: B. a transducer whose output depends only on the current state
Explanation:
The correct answer is 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:
The correct answer is 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:
pumping lemma for regular languages is correctly described as a tool used to prove some languages are not regular.
