Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q101: Fill in the blank: The regular expression for the language that does not end in aa or bb over Σ = {a, b} is _____.
- A: (a+b)* (ab+ba)
- B: Λ + a + b + (a+b)*
- C: (a + b)*
- D: ab + ba
View Answer
A
Q102: The transition graph for a finite automaton consists of which of the following?
- A: Finite number of states and transitions
- B: Infinite number of states and inputs
- C: Infinite set of transitions
- D: Only one start and final state
View Answer
A
Q103: The language L = {aa, bab, aabb, bbba} is accepted by which of the following finite automata?
- A: FA1
- B: FA2
- C: FA3
- D: FA4
View Answer
C
Q104: Which of the following is an example of a language accepted by a finite automaton?
- A: L = {Λ, b, ab, bb}
- B: L = {a, ab, bb, ba}
- C: L = {a, b, bb, ba}
- D: L = {Λ, a, b}
View Answer
A
Q105: Fill in the blank: The regular expression Λ + a + b + (a+b)* (ab+ba+bb) describes a language that ____.
- A: Does not end in aa
- B: Ends in bb
- C: Contains only a and b
- D: Ends with aa or bb
View Answer
A
Q106: The language L = {w belongs to {a,b}*: length(w) ≥ 2 and w does not end in aa or bb} is accepted by which FA?
- A: FA1
- B: FA2
- C: FA3
- D: FA4
View Answer
C
Q107: What does a TG stand for in automata theory?
- A: Transition Gate
- B: Temporal Graph
- C: Transition Graph
- D: Triggered Gate
View Answer
C
Q108: What is the language accepted by a TG defined as?
- A: The set of all rejected strings
- B: The set of all accepted strings
- C: The set of final states
- D: The set of all possible strings
View Answer
B
Q109: If a string has at least one path in TG from an initial state to a final state, the string is considered:
- A: Rejected
- B: Accepted
- C: Undefined
- D: Invalid
View Answer
B
Q110: Which of the following TG accepts an empty language?
- A: TG1
- B: TG2
- C: TG3
- D: All of the above
View Answer
D