toc

Question

There exist algorithms to decide if a finite automata

• A.     accepts the empty set.
• B.     accepts a finite number of strings.
• C.     accepts an infinite number of strings.
• D.     all of the above.

Comments

sir , its ACE.

---

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.

---

yes sir u r correct in ACE most of the question are wrong ..

Answer 1

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