Consider the DFA M and NFA M₂ as defined below. Let the language accepted by…
PYQ GATE 1988
Consider the DFA M and NFA M₂ as defined below. Let the language accepted by machine M be L. What language machine M₂ accepts, if
F₂=B?
M=(Q, Σ, δ, q₀, F); M₂=(Q₂, Σ, δ₂, q₀₀, F₂).
Q₂=(Q×Q×Q) ∪ {q₀₀}.
δ₂(q₀₀, ε)={⟨q₀,q,q⟩ | q∈Q}.
δ₂(⟨p,q,r⟩, σ)=⟨δ(p,σ),δ(q,σ),r⟩ for all p,q,r∈Q and σ∈Σ.
A={⟨p,q,r⟩ | p∈F; q,r∈Q}.
B={⟨p,q,r⟩ | q∈F; p,r∈Q}.
C={⟨p,q,r⟩ | p,q,r∈Q; ∃s∈Σ*, δ(p,s)∈F}.
D={⟨p,q,r⟩ | p,q∈Q; r∈F}.
Sign up free to check your answer
Sign up freeLoading lesson…

