2 votes 2 votes There exist algorithms to decide if a finite automata accepts the empty set. accepts a finite number of strings. accepts an infinite number of strings. all of the above. Theory of Computation theory-of-computation finite-automata + – focus _GATE asked Nov 5, 2015 focus _GATE 561 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments focus _GATE commented Nov 5, 2015 reply Follow Share sir , its ACE. 0 votes 0 votes Arjun commented Nov 5, 2015 reply Follow Share virtual gate, test book > made easy > ACE is my suggestion for priority for mock tests and even these should be strictly after ALL previous GATE questions which are in syllabus. Last year ACE keys for GATE CSE was horribly bad. 0 votes 0 votes focus _GATE commented Nov 5, 2015 reply Follow Share yes sir u r correct in ACE most of the question are wrong .. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes DFA accept all language with finite strings. Pumping Lemma used to decide/test whether the the given infinite language will be accept by DFA or Not. Answer : D Yash Gupta answered Nov 7, 2015 Yash Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.
