Which one of the following regular expressions defines the language of all strings that have an even number of a’s and an odd number of b’s over the alphabet {a b}? code example
Example: 1. Write regular expression to describe a languages consist of strings made of even numbers a and b. CO1 K3
((a+b)(a+b))*