Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q121: Which regular expression represents the language containing triple 'a' or triple 'b'?
- A: (a+b)(aa + bb)(a+b)
- B: (a+b)(aaa + bbb)(a+b)
- C: (a+b)(ab+ba)(a+b)*
- D: (a+b)+aa+bb+(a+b)*
View Answer
B
Q122: What does the regular expression a(a + b)*b + b(a + b)*a represent?
- A: Strings beginning and ending in different letters
- B: Strings containing double 'a'
- C: Strings starting with 'b'
- D: Strings with an even number of 'a's
View Answer
A
Q123: The regular expression a(a + b)*a + b(a + b)*b represents which language?
- A: Strings starting with 'b'
- B: Strings with odd-length
- C: Strings of length two or more, beginning and ending in the same letter
- D: Strings containing triple 'a'
View Answer
C
Q124: The EVENEVEN language can be expressed by which of the following regular expressions?
- A: (aa+bb+(ab+ba)(aa+bb)(ab+ba))
- B: (aa+ab)*
- C: (a+b)(aa+bb)(a+b)
- D: (ab)(aa+bb)*
View Answer
A
Q125: In the EVENEVEN language, what condition is met?
- A: Strings containing exactly two 'a's
- B: Strings with an even number of 'a's and 'b's
- C: Strings that end in 'bb'
- D: Strings starting with 'a'
View Answer
B
Q126: What does the expression (aa)b(b+(aa(aa)b)) bb represent?
- A: Strings containing only 'a'
- B: Strings where 'a' occurs in even clumps and ends in three or more 'b's
- C: Strings beginning with 'b'
- D: Strings starting and ending with different letters
View Answer
B
Q127: How many successful paths are traced by the string abbbabbbabba in the given TG example?
- A: 1
- B: 2
- C: 3
- D: 4
View Answer
C
Q128: What is a Generalized Transition Graph (GTG) made up of?
- A: Finite number of states
- B: Infinite input set
- C: Regular expressions on transitions
- D: Both A and C
View Answer
D
Q129: In a GTG, what is the label of a transition edge typically associated with?
- A: A state
- B: An input letter
- C: A regular expression
- D: A final state
View Answer
C
Q130: What is true about the string abbbabbbabba in the given TG example?
- A: It is rejected by the TG
- B: It is accepted by the TG
- C: It traces only one path
- D: It does not contain 'a'
View Answer
B