0 votes 0 votes Give regular expression for the complement of the language L = { an bm : n<4, m<=3} Theory of Computation theory-of-computation regular-expression + – Ayush Upadhyaya asked Mar 9, 2017 Ayush Upadhyaya 495 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Complement of the language L=a<4 & b≤3 will be L'= a≥4 or b>3 (which is also equal to b≥4). So, regular expression for L' can be written as L'= a⁴a*b* +a*b⁴b*. Sudeep Sharma answered Mar 9, 2017 Sudeep Sharma comment Share Follow See 1 comment See all 1 1 comment reply 2018 commented Mar 9, 2017 reply Follow Share $L^{c}=\Sigma ^{*}-{ }\left \{ a^{n} b^{m} : n<4, m<=3 \right \}$ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes let me know if there is any shorter way 2018 answered Mar 9, 2017 2018 comment Share Follow See all 3 Comments See all 3 3 Comments reply Akriti sood commented Mar 9, 2017 reply Follow Share (a*a*a*)* (b*b*b*)* is'nt this okay?? as n<4 and m <=3 0 votes 0 votes 2018 commented Mar 9, 2017 reply Follow Share asking about complement of L 0 votes 0 votes Akriti sood commented Mar 9, 2017 reply Follow Share ooh thanks..i did nt notice 1 votes 1 votes Please log in or register to add a comment.