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. a transducer whose output depends on current state and input symbol
Explanation:
Mealy machine is correctly described as a transducer whose output depends on current state and input symbol.
Choose an option to check your answer.
Correct Answer: C. a rule that describes how grammar symbols may be rewritten
Explanation:
production rule is correctly described as a rule that describes how grammar symbols may be rewritten.
Choose an option to check your answer.
Correct Answer: C. a language that cannot be accepted by any finite automaton
Explanation:
In this course context, non-regular language means 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:
In this course context, Mealy machine means a transducer whose output depends on current state and input symbol.
Choose an option to check your answer.
Correct Answer: D. a rule that describes how grammar symbols may be rewritten
Explanation:
In this course context, production rule means a rule that describes how grammar symbols may be rewritten.
Choose an option to check your answer.
Correct Answer: D. a property showing a language class remains in the class after an operation
Explanation:
The suitable explanation is a property showing a language class remains in the class after an operation.
Choose an option to check your answer.
Correct Answer: B. a language that cannot be accepted by any finite automaton
Explanation:
The suitable explanation is a language that cannot be accepted by any finite automaton.
Choose an option to check your answer.
Correct Answer: C. a transducer whose output depends on current state and input symbol
Explanation:
The suitable explanation is a transducer whose output depends on current state and input symbol.
Choose an option to check your answer.
Correct Answer: C. the union of two regular languages is also regular
Explanation:
The correct answer is the union of two regular languages is also regular.
Choose an option to check your answer.
Correct Answer: D. a standard example of a non-regular language
Explanation:
The correct answer is 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:
The correct answer is 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:
regular languages closed under union is correctly described as the union of two regular languages is also regular.
