Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Given R = b * * ( b a + a + ) + b * * and S = ( a * * b

Given R=b**(ba+a+)+b** and S=(a**ba+b)**
a) Give an example of a string that is neither in the language of R nor in S.[2 marks]
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 001.[3 marks]
f) Design a regular expression that accepts the language of all binary strings which their length is odd with no occurrences of 11.[3 marks]
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Students also viewed these Databases questions