Oops! It appears that you have disabled your Javascript. In order for you to see this page as it is meant to appear, we ask that you please re-enable your Javascript!

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 Click Here to Know More
Instructor, Researcher, Blogger, SEO Expert, Poet and Publisher of International Journal Of Software, Technology & Science ISSN : 2616 - 5325
Dear Professors and Resarchers!You are welome to Cite these tutorials in your research or slides etc. Please don't forget to mention the reference of website. Copy Paste of text is strcitly forbidden. Images can be reuse because images are protected with watermark.

Leave a Reply

Your email address will not be published. Required fields are marked *