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 is ________. (Answer in integer)

GATE 2025 CSE & IT Q59 — Computer Science

GATE 2025Set 1Q59NATanswer keyexplanation soonmedium

Computer Science · Theory of Computation - Finite Automata

Concept intelligence

Drill mode: fsm · 1/4

Figure from the original GATE 2025 paper. (IIT Roorkee archive)

Your answer

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

📊 has diagram∑ has math▥ has table

FSMState MinimizationFinite AutomataDigital Logic