Home
Theory of Computation

Filters

Found 1 Question

Set Default

Exams

GATE CS

Subjects

Theory of Computation

Topics

NFA to DFA Conversion and Minimization
Closure Properties of Language Classes
Context Free Grammars
Context Free Languages
Context-free grammars and push-down automata
Regular Languages and Finite Automata
Regular and contex-free languages, pumping lemma
Regular expressions and finite automata
Turing machines and undecidability

List of top Theory of Computation Questions on NFA to DFA Conversion and Minimization

Let \(M\) be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.
Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalent to \(M\)?

GATE CS - 2026
GATE CS
Theory of Computation
NFA to DFA Conversion and Minimization

terms & conditions

Privacy & Policy

© 2026 Patronum Web Private Limited