Let Σ be the set of all bijections from {1, ... , 5} to {1, ... , 5}, where id denotes the identity function, i.e. id(j) = j, ∀j. Let ∘ denote composition on functions. For a string x = x1 x2 ⋯ xn ∈ Σn, n ≥ 0 , let π(x) = x1 ∘ x2 ∘ ⋯ ∘ xn.

Consider the language L = {x ∈ Σ| π(x) = id}. The minimum number of states in any DFA accepting L is ______.

This question was previously asked in
GATE CS 2019 Official Paper
View all GATE CS Papers >

Answer (Detailed Solution Below) 120

Free
GATE CS Full Mock Test
5.3 K Users
65 Questions 100 Marks 180 Mins

Detailed Solution

Download Solution PDF

Total number of bijective from A → A where A = {1,2 3, 4, 5} is 5! = 120.

The DFA for accepting L will have 5! = 120 states, since we need one state for every possible permutation function on 5 elements.

Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

Hot Links: teen patti gold real cash teen patti master list teen patti gold apk download