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. the set of strings that belong to at least one of the languages
Explanation:
In this course context, union of languages means the set of strings that belong to at least one of the languages.
Choose an option to check your answer.
Correct Answer: B. the string of length zero, usually denoted by epsilon
Explanation:
The suitable explanation is the string of length zero, usually denoted by epsilon.
Choose an option to check your answer.
Correct Answer: A. a machine model with a finite number of states
Explanation:
The suitable explanation is a machine model with a finite number of states.
Choose an option to check your answer.
Correct Answer: D. a set of strings formed over an alphabet according to rules
Explanation:
The correct answer is a set of strings formed over an alphabet according to rules.
Choose an option to check your answer.
Correct Answer: D. any set of strings over that alphabet
Explanation:
The correct answer is any set of strings over that alphabet.
Choose an option to check your answer.
Correct Answer: A. a finite automaton with exactly one transition for each state-symbol pair
Explanation:
The correct answer is a finite automaton with exactly one transition for each state-symbol pair.
Choose an option to check your answer.
Correct Answer: C. a set of strings formed over an alphabet according to rules
Explanation:
formal language is correctly described as a set of strings formed over an alphabet according to rules.
Choose an option to check your answer.
Correct Answer: C. any set of strings over that alphabet
Explanation:
language over an alphabet is correctly described as any set of strings over that alphabet.
Choose an option to check your answer.
Correct Answer: C. a finite automaton with exactly one transition for each state-symbol pair
Explanation:
DFA is correctly described as a finite automaton with exactly one transition for each state-symbol pair.
Choose an option to check your answer.
Correct Answer: D. a set of strings formed over an alphabet according to rules
Explanation:
In this course context, formal language means a set of strings formed over an alphabet according to rules.
Choose an option to check your answer.
Correct Answer: D. any set of strings over that alphabet
Explanation:
In this course context, language over an alphabet means any set of strings over that alphabet.
Choose an option to check your answer.
Correct Answer: C. a finite automaton with exactly one transition for each state-symbol pair
Explanation:
In this course context, DFA means a finite automaton with exactly one transition for each state-symbol pair.
