What Are the Differences and Solutions for Automata Theory Language Constraints?

[hamood_d10]

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

 

[Mark44]

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

http://s8.postimg.org/ijqxoszrl/IMG_0064.jpg

http://s8.postimg.org/kpl8jb381/IMG_0065.jpg

The images are tiny - too small to read.

 

[hamood_d10]

The images are tiny - too small to read.

sorry my bad i fix them

 

[Mark44]

Pick one or at most two questions, and show us what you have done. We're not going to spoonfeed you the answers.

 

[hamood_d10]

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 rest i really need help

 

[hamood_d10]

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) - L(G) = { an bm cm | n , m > 0}

WHATS THE DIFFERENCE BETWEEN THE Q2(A) AND Q2(B)?

ANSWER OF Q2(A) (IS IT RIGHT?)
S → aSdd | A
A → bAc | bc

ANSWER OF Q2(B)??

CAN YOU HELP ME ANSWER Q2(B) AND Q1(B) ?