Please Answer The Following Question Also The Part E Of The Question Says Design A Regular Expression That Accepts T 1 (87.95 KiB) Viewed 9 times
Also, the part e) of the question says: design a regularexpression that accepts the language of all binary strings with nooccurrences of 010
5. Given R=(0*10+)* (1 U €) and S =(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 Rand S. [2 marks] e) Design a regular expression that accepts the language of all binary strings with no occurrences of 010 [4 marks]
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!