Register

Whether regular or not

237 views
1 votes
1 votes

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

User Avatar

1 Answer

0 votes
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.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
rohan.1737 asked Aug 17, 2018
724 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?
Is there any way to check whether a language is regular or not without using Pumping lemma?
User Avatar
6 votes
6 votes
2 answers
3
akshay_845 asked Jan 23, 2017
1,131 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
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
User Avatar
2 votes
2 votes
2 answers
4
Kaushal28 asked Sep 21, 2016
2,320 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?
If any grammer is given, how can we tell that the grammar is regular or not? Is that any perticular method?
User Avatar
Link Copied!