Question: Write a regular expression for each of the following: All strings over the alphabet { a , b } with ' ab ' as substring:

Write a regular expression for each of the following: All strings over the alphabet {a,b} with 'ab' as substring: (a|b)ab(a|b)
all strings over the alphabet { a, b } that contain exactly two a's
all strings over the alphabet { a, b } that do not end with ab
all strings over the alphabet { a, b } that contain an even number of bs.
all strings which do not contain the substring ba

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!