Question: Write regular expressions for the following languages. Please do not build a finite automation and then convert it. That is indirect solution and wont get

Write regular expressions for the following languages. Please do not build a finite automation and then convert it. That is indirect solution and wont get points

1.1. The set of strings over alphabet {a,b,c} containing at least one a and at most one b

1.2. The set of strings over alphabet {a,b,c} containing at least one a or at most two bs

1.3. The set of binary strings not containing 111 as substring

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!