GATE CS 2025 (Afternoon) — Question 60

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT2 marksHard

Let \( \Sigma = \{1, 2, 3, 4\} \). For \( x \in \Sigma^* \), let \( \text{prod}(x) \) be the product of symbols in \( x \) modulo 7. We take \( \text{prod}(\epsilon) = 1 \), where \( \epsilon \) is the null string. For example, \( \text{prod}(124) = (1 \times 2 \times 4) \bmod 7 = 1 \). Define \( L = \{x \in \Sigma^* \mid \text{prod}(x) = 2\} \). The number of states in a minimum state DFA for \( L \) is ________. (Answer in integer)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)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