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: B. a property showing a language class remains in the class after an operation
Explanation:
In this course context, closure property means a property showing a language class remains in the class after an operation.
Choose an option to check your answer.
Correct Answer: B. a transition taken without consuming an input symbol
Explanation:
The suitable explanation is a transition taken without consuming an input symbol.
Choose an option to check your answer.
Correct Answer: B. a non-accepting state from which acceptance is impossible for the remaining input
Explanation:
The suitable explanation is a non-accepting state from which acceptance is impossible for the remaining input.
Choose an option to check your answer.
Correct Answer: D. one or more repetitions of a language or expression
Explanation:
The suitable explanation is one or more repetitions of a language or expression.
Choose an option to check your answer.
Correct Answer: B. a graphical representation of states and transitions of an automaton
Explanation:
The correct answer is a graphical representation of states and transitions of an automaton.
Choose an option to check your answer.
Correct Answer: D. a function mapping a state and input symbol to exactly one next state
Explanation:
The correct answer is a function mapping a state and input symbol to exactly one next state.
Choose an option to check your answer.
Correct Answer: D. the set of strings that belong to at least one of the languages
Explanation:
The correct answer 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 graphical representation of states and transitions of an automaton
Explanation:
transition graph is correctly described as a graphical representation of states and transitions of an automaton.
Choose an option to check your answer.
Correct Answer: C. a function mapping a state and input symbol to exactly one next state
Explanation:
DFA transition function is correctly described as a function mapping a state and input symbol to exactly one next state.
Choose an option to check your answer.
Correct Answer: D. the set of strings that belong to at least one of the languages
Explanation:
union of languages is correctly described as the set of strings that belong to at least one of the languages.
Choose an option to check your answer.
Correct Answer: D. a graphical representation of states and transitions of an automaton
Explanation:
In this course context, transition graph means a graphical representation of states and transitions of an automaton.
Choose an option to check your answer.
Correct Answer: C. a function mapping a state and input symbol to exactly one next state
Explanation:
In this course context, DFA transition function means a function mapping a state and input symbol to exactly one next state.
