GATEverse
← GATE CSE 1987

Q2j

NATMarks unknown

State whether the following statements are TRUE or FALSE: A minimal DFA that is equivalent to an NDFA with nn nodes has always 2n2^{n} states.

Sign in to save attempts.

Loading…