Question
Download Solution PDFDefinition of a language L with alphabet {a} is given as following.
L= {ank | k > 0, and n is a positive integer constant}
What is the minimum number of states needed in a DFA to recognize L?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFLet n =3 and k = 1,2,3,.....
L =
Therefore, DFA will accept the language aaa,aaaaaa, aaaaaaaaa, ... i.e.
So, (n+1) states
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.