Expressive Power::: FA< Deterministic PDA < Non-Deterministic PDA <LBA < TM
A. There is a unique minimal DFA for every regular language is TRUE.
B. Every NFA can be converted to an equivalent PDA is TRUE because PDA is more powerful than NFA
C. Complement of every context-free language is recursive. is TRUE.
D. Every non-deterministic PDA can be converted to an equivalent deterministic PDA. is FALSE because NPDA is more powerful than DPDA. E.g. L= {ww^r | w ϵ {a,b}* } is a CFL but not DCFL, i.e. it can be recognized by NPDA but not by DPDA