GATE CS 2025 (Forenoon) — Question 59

Digital LogicSequential Circuits (Flip-Flops, Registers, Counters)NAT2 marksHard

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)
Question image
Practise the full 2025-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Sequential Circuits (Flip-Flops, Registers, Counters)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group