Concept drill

nfa to dfa

GATE CSE & IT · Turing Machines & Computability · 2008-2026

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Hopcroft-Ullman / Dragon Book

Automata, languages, parsing, syntax-directed translation

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

2026 PYQ

Let $M$ be a non-deterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be the number of states in the minimal determinist...

mediumanswer keyelite explanation

2008 PYQ

Which of the following statement is false?

easyanswer key