Register

Whether regular or not

444 views
1 1 vote

 Is this  a regular language or not  ambn where   m = 2n+1  is regular or not

1 Answer

0 0 votes
I assume it is closed on Sigma Star.

So it is infinite and we cannot get contreol over double N and equal that .

So it is not regular.
Voting & Accepting an answer helps improve the community
← Previous · test seriesNext → · MadeEasy Test Series...
← Previous in category · ACE Test SeiesNext in category → · regular or not
Position:
Show:

Related questions

0 0 votes
2 2 answers
1.5k
1.5k views
rohan.1737 asked Aug 17, 2018
1,482 views
Self Doubt in checking whether a language is regular or not
Is there any way to check whether a language is regular or not without using Pumping lemma?
3 3 votes
3 answers 3 answers
2.8k
2.8k views
Durgesh Singh asked Aug 14, 2017
2,818 views
Testing whether a language is regular or not. {XwwRY / X,Y∈ (0,1)*, w∈(0,1)+}
6 6 votes
2 answers 2 answers
2.1k
2.1k views
akshay_845 asked Jan 23, 2017
2,123 views
Whether languages regular or not
L1 ={ a^pb^q | p+q>=10^6}L2= { a^mb^n | m-n>=10^6} i m not getting this can someone help me with this
2 2 votes
2 2 answers
3.2k
3.2k views
Kaushal28 asked Sep 21, 2016
3,232 views
How to determine whether the grammar is regular or not?
If any grammer is given, how can we tell that the grammar is regular or not? Is that any perticular method?