Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

State Minimization

GATE CSE & IT · Theory of Computation - Finite Automata · 2000-2025

3
PYQs
67%
keyed
0
elite explanations
2
years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2025 Q59

Consider a finite state machine (FSM) with one input X and one output f, represented by the given state transition table. The minimum number of states required to realize this FSM...

mediumanswer key
2025 PYQ

Consider a finite state machine (FSM) with one input $X$ and one output $f$, represented by the given state transition table. The minimum number of states required to realize this...

mediumbasic explanation
2000 PYQ

What can be said about a regular language $$L$$ over $$\left\{ a \right\}$$ whose minimal finite state automation has two states?

mediumanswer key