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 all those strings having even and consecutive b’s in theory of automata

Last modified on May 26th, 2018 at 2:05 pm

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 1Part 2Part 3
aa(a+b)*ba

 

 

 

Prof. Fazal Rehman Shamil
Researcher, Publisher of International Journal Of Software Technology & Science ISSN: 2616-5325
Instructor, SEO Expert, Web Programmer and poet.
Feel free to contact.