JNU 2018-2 PhD CS
October 26, 2023JNU 2018-2 PhD CS
October 26, 2023JNU 2018-2 PhD CS
| Question 5 |
The construction time for DFA having m nodes from an equivalent NFA is
| O(m2)
| |
| O(2m) | |
| O(m) | |
| O(log m) |
Question 5 Explanation:
The construction time for a DFA from an NFA is O(2^m) where m is the number of nodes in NFA because if no. of nodes in NFA is m then DFA can have upto 2^m states.
Correct Answer: B
Question 5 Explanation:
The construction time for a DFA from an NFA is O(2^m) where m is the number of nodes in NFA because if no. of nodes in NFA is m then DFA can have upto 2^m states.
Subscribe
Login
0 Comments