retagged by
1,269 views

2 Answers

Best answer
10 votes
10 votes

(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

 

selected by
2 votes
2 votes
  • The Myhill-Nerode theorem is an important characterization of regular languages. and is is used for regular language.
  •  
  • pumping lemma is a negativity test and it is used for non regular.
  •  
  • if you drow a dfa . then the language is regular .
  •  
  • if you forming a regular expression .then the language is regular

so option 1,3,4 is right

Related questions

0 votes
0 votes
1 answer
4
M_Umair_Khan42900 asked Dec 29, 2022
754 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...