Construct the regular expressions for the following regular languages over alphabet {0,1}:
- The set of all strings having either 000 or 111 as a substring.
- The set of all strings having neither 000 nor 111 as a substring.
Construct the regular expressions for the following regular languages over alphabet {0,1}:
- The set of all strings having either 000 or 111 as a substring.
- The set of all strings having neither 000 nor 111 as a substring.