GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least

A

N2

B

2N

C

2N

D

N!

asked in Regular expressions and finite automata by gate

Related questions

The best answer to any question