(0+1)*0(0+1)*0(0+1)*
a) strings with the substring 00
b) strings with at most two 0’s
c) strings with at least two 0’s
d) strings beginning and ending with either 0 or 1
Which one of the following languages over the alphabet {0, 1} is described by the regular expression?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which one of the following languages over the alphabet {0, 1} is described by the regular expression?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!