Find a CFG that generates the language
Q1(A) - L(G) = { an bm | 0 ≤ n ≤ m ≤ 2n}
Q1(B) - L(G) = { an bm | 0 ≤ n, m}
WHATS THE DIFFERENCE BETWEEN THE Q1(A) AND Q1(B)?
ANSWER OF Q1(A) (IS IT RIGHT?)
S → aSb | aSbb | ^
ANSWER OF Q1(B)
??
Q2(A) - L(G) = { an bm cm d2n | n ≥ 0 , m > 0}
Q2(B) -...
Q.NO1(A)
ab, aabb, aaabbb, aaaabbbb, aaaaaabbbbb.
Q.NO1(B)
aabb, aaabbb, aaaabbbb, aaaaaabbbbb, aaaaaaabbbbbb.
i don't know if they are right! also what it means by describe the language?
Q.NO7(A)
S → aSdd | A
A → bAc | bc
Q.NO7(B)
S → aSb | aSbb | λ
Im not sure about these or about the...
Im currently studying Automata Theory and i have these questions that i want to answer
the problem I am not sure if i answer them currently
can anyone help me to solve them properly