DFA
October 4, 2023Theory-of-Computation
October 4, 2023Theory-of-Computation
|
Question 4
|
Let M = {K,Σ,δ,s,F} be a finite state automaton, where
K = {A,B}, Σ = {a,b}, s = A, F = {B}, δ(A,a) = A, δ(A,b) = B, δ(B,a) = B and δ(B,a) = A
A grammar to generate the language accepts by M can be specified as G = (V,Σ,R,S), where V = K∪Σ, and S = A.
Which one of the following set to rules will make L(G) = L(M)?
|
{A→aB, A→bA, B→bA, B→aA, B→ε}
|
|
|
{A→aA, A→bB, B→bB, B→aA, B→ε}
|
|
|
{A→bB, A→aB, B→aA, B→bA, A→ε}
|
|
|
{A→aA, A→bA, B→bB, B→aA, A→ε}
|
Correct Answer: C
Subscribe
Login
0 Comments