Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

   

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]

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

Recommended Textbook for

Discrete and Combinatorial Mathematics An Applied Introduction

Authors: Ralph P. Grimaldi

5th edition

201726343, 978-0201726343

More Books

Students also viewed these Programming questions

Question

Contrast Plato with Aristotle in their approaches to knowledge.

Answered: 1 week ago