GATE CS 2019 (Forenoon) — Question 58

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

Let \( \Sigma \) be the set of all bijections from \( \{1, ..., 5\} \) to \( \{1, ..., 5\} \), where id denotes the identity function, i.e. \( id(j) = j, \forall j \). Let \( \circ \) denote composition on functions. For a string \( x = x_1 x_2 ... x_n \in \Sigma^n, n \ge 0 \), let \( \pi(x) = x_1 \circ x_2 \circ ... \circ x_n \). Consider the language \( L = \{x \in \Sigma^* \mid \pi(x) = id\} \). The minimum number of states in any DFA accepting \( L \) is ________.
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
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