1 votes 1 votes $L_1=\{a^nb^m\mid n\geq 3,m\leq 4\}$ Find complement of $L_1.$ Theory of Computation regular-language theory-of-computation + – Ahsanul Hoque asked Feb 14, 2018 • edited Jun 14, 2022 by Arjun Ahsanul Hoque 360 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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} CS.user answered Mar 7, 2018 CS.user comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes an bm / n <= 3,m>=4 this is L1 Compliment i think so suryaprakash answered Feb 14, 2018 suryaprakash comment Share Follow See all 0 reply Please log in or register to add a comment.