GATE Computer Science (CS) 2011 Solved Paper
© examsiri.com
Question : 52 of 65
Marks:
+1,
-0
Definition 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?
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?
Go to Question: