BANK IBPS SO Mock Test (Pre + Mains) 2024 Theory of Computation Regular Languages and Finite Automata Finite Automata
If there are ‘n’ numbers of states in NFA, then its equivalent DFA may contain atmost _______ number of states
1
2n
2
n
3
n2
4
2n+1
5
n!