## Discussion Forum

Que. | Which one of the following is FALSE? |

a. | There is unique minimal DFA for every regular language |

b. | Every NFA can be converted to an equivalent PDA |

c. | Complement of every context-free language is recursive |

d. | Every nondeterministic PDA can be converted to an equivalent deterministic PDA |

Answer:Every nondeterministic PDA can be converted to an equivalent deterministic PDA |