Answer Happy

Posted: **Tue Sep 07, 2021 7:14 am**

: Give A Regular Expression Presenting Each Of The Following Languages Over The Alphabet A B L1 A B An N 1 M 1 1 (18.25 KiB) Viewed 111 times

Give a regular expression presenting each of the following languages over the alphabet {a,b): L1={a” b an|n> 1, m > 1}. b. L2={ab(b) m 2 1}. c. All strings do not contain 3 a's