GATE CSE
First time here? Checkout the FAQ!
x
0 votes
30 views

1 L = {aman: m>=1, n>=1}

2 =  L = {aman: m>=0, n>=0}

 

 

asked in Theory of Computation by Loyal (3.4k points)   | 30 views

1) L = aaa* = aa+

2) L= a*

@ joshi_nitish  So, both are regular L?

Also, please tell me, is it necessary that if a L is Regular then it should/must generate epsilon i.e empty string?

It is not necessary that a regular language will generate empty string. e.g take the language which takes strings on (0+1)* which have only one 0. You can think of many examples where the language does not contains empty string.

@Rishabh Gupta 2 (0+1)* which have only one 0. 

one 0?! How, if we put *=0  in (0+1)* then we can generate epsilon. I'm sorry, I'm not following you!

Language which contains exactly one 0.

Is this a regular language?

Yes. You can easily draw fda for it. And it's regular expression will be 1*01*

So this is a regular language which does not contain empty string.

This is an example which shows that if a language is regular than it is not necessary that it contains empty string.

Got it?

@Rishabh Gupta 2 Yes Sir, understood. Thanks

Please log in or register to answer this question.

Related questions



Top Users Sep 2017
  1. Habibkhan

    8586 Points

  2. rishu_darkshadow

    3046 Points

  3. Warrior

    2862 Points

  4. Arjun

    2800 Points

  5. A_i_$_h

    2550 Points

  6. manu00x

    2116 Points

  7. nikunj

    1990 Points

  8. Bikram

    1874 Points

  9. makhdoom ghaya

    1820 Points

  10. SiddharthMahapatra

    1718 Points


26,301 questions
33,864 answers
80,439 comments
31,203 users