Directions (Q91–95): A machine is represented by states Q, input alphabet Σ = {a, b}, a transition function δ, initial state q0 and final states F. It accepts all strings over Σ that contain abb as a substring, with any combination of a and b before and after it.
For the above mentioned passage which of the following is correct?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. 
Explanation
The language is (a+b)*abb(a+b)*. The NFA in C loops on a, b at the start, reads a, b, b in sequence, and loops on a, b in the final state — exactly that language.
More Theory of Computation and Compilers questions
- Which of the following represented the minimum state DFA for the above specified passage?
- For the above specified passage, which of the following is DFA for the language represented/accepeted by machine?
- For the above specified passage, which of the following represents the regular expression?
- Consider the Grammar: T → Qx Q → RS R → y ∣ ϵ S → z ∣ ϵ Here x, y, z are terminals and T, Q, R, S are non- terminals. What will be the foll…
- Which of the following tasks could be attained using syntax trees in compiler design ? (A) Type Checking (B) Code Generation (C) Code Optim…
- Arrange the following stages of parsing in the correct order as they typically occur in the compilation process. (A) Lexical Analysis (B) S…