## Discussion Forum

Que. | Let L be a set accepted by a non deterministic finite automaton. The number of states in non-deterministic finite automaton is |Q|. The maximum number of states in equivalent finite automaton that accepts L is |

a. | |Q| |

b. | 2|Q| |

c. | 2^|Q| – 1 |

d. | 2^|Q| |

Answer:2^|Q| |