Show that there is no language s such that s is the


Problem

a. Consider the language L of all strings of a's and b's that do not end with b and do not contain the substring bb. Find a finite language S such that L = S∗.

b. Show that there is no language S such that S∗ is the language of all strings of a's and b's that do not contain the substring bb.

Request for Solution File

Ask an Expert for Answer!!
Theory of Computation: Show that there is no language s such that s is the
Reference No:- TGS02654548

Expected delivery within 24 Hours