5) Given R = b (ba*)*b* and S = (a*ba*b)* a) Give an example of a...

   

Transcribed Image Text:

5) Given R = b (ba*)*b* and S = (a*ba*b)* a) Give an example of a string of length five that is neither in the language of R nor in S. [2 marks] b) Give an example of a string of length five that is in the language of S but not R. [2 marks] c) Give an example of a string of length five that is in the language of R but not S. [2 marks] d) Give an example of a string of length five 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 aab. [3 marks] f) Design a regular expression that accepts the language of all binary strings with no occurrences of 11 or 00. The accepted strings may have 00, in this case the strings must not have 11, or if the accepted strings contain 11, in this case the strings must not have 00. Strings with no occurrences of both, should be accepted as well. [4 marks] 5) Given R = b (ba*)*b* and S = (a*ba*b)* a) Give an example of a string of length five that is neither in the language of R nor in S. [2 marks] b) Give an example of a string of length five that is in the language of S but not R. [2 marks] c) Give an example of a string of length five that is in the language of R but not S. [2 marks] d) Give an example of a string of length five 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 aab. [3 marks] f) Design a regular expression that accepts the language of all binary strings with no occurrences of 11 or 00. The accepted strings may have 00, in this case the strings must not have 11, or if the accepted strings contain 11, in this case the strings must not have 00. Strings with no occurrences of both, should be accepted as well. [4 marks]