Q1.6
MCQ1 mark, −0.25Given an arbitrary non-deterministic finite automaton (NFA) with states, the maximum number of states in an equivalent minimized DFA at least
Sign in to save attempts.
Loading…
Given an arbitrary non-deterministic finite automaton (NFA) with states, the maximum number of states in an equivalent minimized DFA at least
Loading…