Regular expression for the language of all those strings having even and consecutive b’s in theory of automata

Write the Regular expression for the language of all consecutive even length a’s ?

Accepted Strings: 

These all strings are the part of the language so should be accepted by regular expression;

Example strings = {aa, aab, aabaa, aabbaa, aababaa,………}and all other strings that contains consecutive even a’s.

Rejected Strings:

These all strings are not part of the language so should be rejected by regular expression;

Example strings = {a, b, ab, ba, aba, bba, abba,……………..} and all other strings that does not contains consecutive even a’s in strings.

R.E = aa (a+b)*ba

Part 1 Part 2 Part 3
aa (a+b)* ba

 

 

 

Fazal Rehman Shamil
Welcome to all friends. The reason for our success is only your love for T4Tutorials. Our team is always available to answer your queries regarding any kind of confusions or discussion regarding your study and career matters. For discussion with us please join our facebook group "T4Tutorials.com". The link of the group is mentioned below. Thanks and love to all for connecting with us. We are nothing without you. Love you all.....
https://web.facebook.com/groups/2066136233601097/