Answered step by step
Verified Expert Solution
Question
1 Approved Answer
7. Find regular expressions for the following languages over alphabet {a, b} (a) L1 = {w | | w | mod 3 0} (b) L2
7. Find regular expressions for the following languages over alphabet {a, b}
(a) L1 = {w | | w | mod 3 0}
(b) L2 = {w | na(w)mod3 = 0} where na(w) is the number of as in the string w.
(c) L3 = {an bm | n 2, m 1, nm 3}
(d)L4 is the complement of the language L = {a2n b2m+1 | n, m 0}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started