That's a perfect explanation.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+5 votes

Which of the following are useful in proving a language to be regular?

- Myhill-Nerode theorem
- Pumping lemma
- Drawing an NFA
- Forming a regular expression

(A) All of these

(B) 1, 3 and 4 only

(C) 2, 3 and 4 only

(D) 3 and 4 only

+10 votes

Best answer

(B)1, 3 and 4 only

As from the given options, Myhill-Nerode theorem is useful by providing necessary and sufficient condition for proving that a language regular. Pumping lemma is often used to prove that a language is **non-regular**. Drawing an NFA can be useful to prove a language is regular. Forming a regular expression can also help us prove if it is a regular language

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.2k
- Digital Logic 2k
- Programming & DS 3.7k
- Algorithms 3.2k
- Theory of Computation 4k
- Compiler Design 1.6k
- Databases 3k
- CO & Architecture 2.6k
- Computer Networks 3k
- Non GATE 1k
- Others 1.3k
- Admissions 488
- Exam Queries 436
- Tier 1 Placement Questions 18
- Job Queries 56
- Projects 9

36,204 questions

43,662 answers

124,117 comments

42,947 users