Regular expression for the language of even length strings starting with a and ending with b in theory of automata

Regular expression for the language of even length strings starting with a and ending with b

Accepted Strings: 

All strings of the following pattern should be accepted by RE.

ab, aab, abb,abab,……

Reject strings:

All strings of the following pattern should be rejected by RE.

a, b, ba, aa, bb, ba,bba,……

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

Topic Covered: 

Regular expression for the language of even length strings starting with a and ending with b in theory of automata.
  List of All Regular Expression examples : Click Here 
.

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/

Leave a Reply