The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
34 views

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

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

 

 

asked in Theory of Computation by Boss (5.2k points) | 34 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.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,839 questions
36,693 answers
90,637 comments
34,642 users