Question: give me the regular expression for The language over the alphabet is Sigma = { a , b } where the number of as

give me the regular expression for The language over the alphabet is \Sigma ={a, b} where the number of as is equivalent to 2 or 3 mod 5, or the number of bs is equivalent to 1 or 2 mod 4

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!