• edited by
687 views

2 Answers

3 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}  

Position:
Show:

Related questions

0 0 votes
3 answers 3 answers
495
495 views
0 0 votes
1 1 answer
1.3k
1.3k views
M_Umair_Khan42900 asked Dec 29, 2022
1,262 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 0 votes
1 1 answer
806
806 views
moe12leb asked Nov 2, 2022
806 views
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
0 0 votes
0 0 answers
1.0k
1.0k views
Shamim Ahmed asked Jan 13, 2019
1,011 views
Which of the following RE are equivalent ?(a+b)*abb(a+b)*(a+b)*a(a+b)*bb(a+b)*(a+b)*ab(a+b)*b(a+b)*