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 standard example of a non-regular language
Explanation:
language {a^n b^n | n >= 0} is correctly described as a standard example of a non-regular language.
Choose an option to check your answer.
Correct Answer: C. a grammar where each production has a single non-terminal on the left side
Explanation:
context-free grammar is correctly described as a grammar where each production has a single non-terminal on the left side.
Choose an option to check your answer.
Correct Answer: A. the union of two regular languages is also regular
Explanation:
In this course context, regular languages closed under union means the union of two regular languages is also regular.
Choose an option to check your answer.
Correct Answer: C. a standard example of a non-regular language
Explanation:
In this course context, language {a^n b^n | n >= 0} means a standard example of a non-regular language.
Choose an option to check your answer.
Correct Answer: B. a grammar where each production has a single non-terminal on the left side
Explanation:
In this course context, context-free grammar means a grammar where each production has a single non-terminal on the left side.
Choose an option to check your answer.
Correct Answer: C. a graphical representation of states and transitions of an automaton
Explanation:
The suitable explanation is a graphical representation of states and transitions of an automaton.
Choose an option to check your answer.
Correct Answer: A. a function mapping a state and input symbol to exactly one next state
Explanation:
The suitable explanation is a function mapping a state and input symbol to exactly one next state.
Choose an option to check your answer.
Correct Answer: B. the set of strings that belong to at least one of the languages
Explanation:
The suitable explanation is the set of strings that belong to at least one of the languages.
Choose an option to check your answer.
Correct Answer: B. a state that indicates successful acceptance of an input string
Explanation:
The correct answer is a state that indicates successful acceptance of an input string.
Choose an option to check your answer.
Correct Answer: B. the subset construction method
Explanation:
The correct answer is the subset construction method.
Choose an option to check your answer.
Correct Answer: B. strings formed by joining one string from the first language with one from the second
Explanation:
The correct answer is strings formed by joining one string from the first language with one from the second.
Choose an option to check your answer.
Correct Answer: D. a state that indicates successful acceptance of an input string
Explanation:
accepting state is correctly described as a state that indicates successful acceptance of an input string.
