Question: 1. Write the regular expression for the regular language L over alphabet = {0, 1} consisting of strings which contain exactly three 1's or
1. Write the regular expression for the regular language L over alphabet = {0, 1} consisting of strings which contain exactly three 1's or exactly four 1's. 2. Write a regular expression that will match a non-negative real number with an optional decimal part.
Step by Step Solution
There are 3 Steps involved in it
1 Regular expression for the language L over the alphabet 0 1 consisting ... View full answer
Get step-by-step solutions from verified subject matter experts
