edited by
360 views

2 Answers

3 votes
3 votes

Given language L=anbm/ n>=3 and m<=4, i.e- L contain all the strings that have Num of a>=3 followed by num. of b<=4. Eg- aaaaabb.
Complement of a language contains all strings that are not in the given language.
So Complement of L contains:
1.    Strings starting with b i.e  b(a*b*)* or
2.    { anbm | n<3 or m>4}  
So,  L1=  b(a*b*)* U { anbm/ n<3 or m>4}  

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
787 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)...
0 votes
0 votes
1 answer
2
moe12leb asked Nov 2, 2022
287 views
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4
sripo asked Oct 10, 2018
668 views
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it ju...