Answer to Question #213815 in Discrete Mathematics for Ander

Question

Given  R = (0^*10^+)^+1^*(0∗10+)+1∗ and S =(1^*01^+)^*(1∗01+)∗

.

a)   Give an example of a string that is neither in the language of R nor in S. [2marks]

b)   Give an example of a string that is in the language of  S but not R. [2 marks]

c)   Give an example of a string that is in the language of R but not S. [2 marks]

d)    Give an example of a string that is in the language of R and S. [2 marks]

e)   Design a regular expression that accepts the language of all binary strings with no occurrences of bab [4 marks]

Answer 1

Dear Ander, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order