Question: ( Graded for correctness ) | 2 Functions over languages ( 1 5 points ) : For languages L 1 , L 2 over the

(Graded for correctness)|2 Functions over languages (15 points):
For languages L1,L2 over the alphabet 1={0,1}, we have the associated sets of strings
SUBSTRING(L1)={win1**| there exist a,bin1** such that {:awbinL1}
and
L1@L2={win1**|w=uv for some strings uinL1 and vinL2}
(a) Specify an example language A over 1 such that AO? and yet Substring(A)=O?, or
explain why there is no such example. A complete solution will include either (1) a precise
and clear description of your example language A and a precise and clear description of the
result of computing Substring (A) using relevant definitions to justify this description and
to justify the set equality with O?, or (2) a sufficiently general and correct argument why
there is no such example, referring back to the relevant definitions.
(b) Specify example languages B,C over 1 such that B1** and C1** and yet B@
C=1**, or explain why there are no such examples. A complete solution will include
either (1) a precise and clear description of your example languages B,C and a precise and
clear description of the result of computing B@C using relevant definitions to justify this
description and to justify the set equality with 1**, or (2) a sufficiently general and correct
argument why there is no such example, referring back to the relevant definitions.
(c) Specify example finite languages L1,L2 over 1 such that L1@L2L1 but |L1@L2|=|L1|, or
explain why there are no such examples. A complete solution will include either (1) a precise
and clear description of your example languages L1,L2 and a precise and clear description
of the result of computing L1@L2 using relevant definitions to justify this description and
to justify the cardinality claims and set (in)equality claims, or (2) a sufficiently general and
correct argument why there is no such example, referring back to the relevant definitions.
 (Graded for correctness)|2 Functions over languages (15 points): For languages L1,L2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!