Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q311: Fill in the blank: If L is a language over an alphabet Σ, then (Lc)c = _______.
- A: L
- B: Σ
- C: Lc
- D: ∅
View Answer
A
Q312: How is the complement of L1 ∪ L2 related to the complements of L1 and L2?
- A: (L1 ∪ L2)c = L1c ∩ L2c
- B: (L1 ∪ L2)c = L1c ∪ L2c
- C: (L1 ∪ L2)c = L1 ∩ L2
- D: (L1 ∪ L2)c = (L1c ∪ L2c)c
View Answer
A
Q313: Fill in the blank: To describe the complement of a language, it is essential to describe the _______.
- A: Alphabet of the language
- B: States of the FA
- C: Transitions of the FA
- D: Regular expressions used
View Answer
A
Q314: What does DeMorgan's law for sets state about the intersection of two regular languages?
- A: L1 ∩ L2 is regular
- B: L1 ∪ L2 is regular
- C: L1c ∪ L2c is regular
- D: (L1 ∩ L2)c = L1c ∪ L2c
View Answer
A
Q315: In the given example, if L = {aba, abb}, what is the FA accepting L?
- A: An FA with final states accepting only 'aba' and 'abb'
- B: An FA accepting all strings except 'aba' and 'abb'
- C: An FA accepting all possible strings
- D: An FA with no accepting states
View Answer
A
Q316: Fill in the blank: The theorem stating that if L1 and L2 are regular languages, then L1 ∩ L2 is also regular is proved using _______.
- A: DeMorgan's law for sets
- B: Kleene's theorem
- C: Pumping lemma
- D: Myhill-Nerode theorem
View Answer
A
Q317: What does DeMorgan's law for sets state about the intersection of two regular languages?
- A: (L1c ∪ L2c)c = L1 ∩ L2
- B: (L1 ∪ L2)c = L1c ∩ L2c
- C: (L1 ∪ L2)c = L1 ∩ L2c
- D: (L1 ∩ L2)c = L1 ∪ L2c
View Answer
A
Q318: If L1 and L2 are regular languages, which operation results in a regular language?
- A: L1 ∩ L2
- B: L1 ∪ L2
- C: L1c
- D: All of the above
View Answer
D
Q319: Fill in the blank: Finding regular expressions defining the language L1 ∩ L2 is _______.
- A: Easy
- B: Difficult
- C: Impossible
- D: Always straightforward
View Answer
B
Q320: What is an example of a nonregular language?
- A: Language of all palindromes
- B: Language of all strings with an even number of a’s
- C: Language of all strings over {a, b}
- D: Language of all strings with an odd number of b’s
View Answer
A