Introduction to Formal Languages, Automata Theory and Computation

Appendix . Multiple Choice Questions (Set I)

In each of the following questions, choose the correct answer from the four choices provided.

1.	The following grammar G = (N, T, P, S) N = {S, A, B} T = {a, b, c} P : S → aSa S → aAa A → bB B → bB B → c is is type 3 is type 2 but not type 3 is type 1 but not type 2 is type 0 but not type 1
2.	The following grammar G = (N, T, P, S) N = {S, A, B, C, D, E} T = {a, b, c} P : S → aAB   AB → CD   CD → CE   C → aC   C → b   bE → bc is is type 3 is type 2 but not type 3 is type 1 but not type 2 is type 0 but not type 1
3.	The following grammar G = (N, T, P, S) N = {S, A, B, C} T = {a, b, c} P : S → aS A → bB B → cC C → a is is type 3 is type 2 but not type 3 is type 1 but not type 2 is type 0 but not type 1
4.	The following grammar G = (N, T, P, S) N = {S, A, B, C