Answered step by step
Verified Expert Solution
Question
1 Approved Answer
( Graded for correctness ) | 2 Functions over languages ( 1 5 points ) : For languages L 1 , L 2 over the
Graded for correctness Functions over languages points: For languages over the alphabet we have the associated sets of strings SUBSTRING there exist bin such that : and @ for some strings and a Specify an example language A over such that and yet Substring or explain why there is no such example. A complete solution will include either a precise and clear description of your example language A and a precise and clear description of the result of computing Substring using relevant definitions to justify this description and to justify the set equality with or a sufficiently general and correct argument why there is no such example, referring back to the relevant definitions. b Specify example languages over such that and and yet @ or explain why there are no such examples. A complete solution will include either a precise and clear description of your example languages and a precise and clear description of the result of computing @ using relevant definitions to justify this description and to justify the set equality with or a sufficiently general and correct argument why there is no such example, referring back to the relevant definitions. c Specify example finite languages over such that @ but @ or explain why there are no such examples. A complete solution will include either a precise and clear description of your example languages and a precise and clear description of the result of computing @ using relevant definitions to justify this description and to justify the cardinality claims and set inequality claims, or a sufficiently general and correct argument why there is no such example, referring back to the relevant definitions.
Graded for correctness Functions over languages points:
For languages over the alphabet we have the associated sets of strings
SUBSTRING there exist bin such that :
and
@ for some strings and
a Specify an example language A over such that and yet Substring or
explain why there is no such example. A complete solution will include either a precise
and clear description of your example language A and a precise and clear description of the
result of computing Substring using relevant definitions to justify this description and
to justify the set equality with or a sufficiently general and correct argument why
there is no such example, referring back to the relevant definitions.
b Specify example languages over such that and and yet @
or explain why there are no such examples. A complete solution will include
either a precise and clear description of your example languages and a precise and
clear description of the result of computing @ using relevant definitions to justify this
description and to justify the set equality with or a sufficiently general and correct
argument why there is no such example, referring back to the relevant definitions.
c Specify example finite languages over such that @ but @ or
explain why there are no such examples. A complete solution will include either a precise
and clear description of your example languages and a precise and clear description
of the result of computing @ using relevant definitions to justify this description and
to justify the cardinality claims and set inequality claims, or a sufficiently general and
correct argument why there is no such example, referring back to the relevant definitions.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started