75. Given the following two languages : L1= {anbn| n >=1} ∪{a} L2= {w C wR| w ∈{a, b}* }

Which statement is correct ?

(A) Both L1and L2 are not deterministic.

(B) L1 is not deterministic and L2 is deterministic.

(C) L1 is deterministic and L2 is not deterministic.

(D) Both L1 and L2 are deterministic.

Answer D 

Both can be realized by dpda hence deteteministic.

Ex aabb can be recognized by l1.

Push a till first occurrence of b and pop on every b.

L2  can be realized push w till c . After c, pop and match with next character. Till the end of string or stack is empty.