Question: A language L 1 is smaller than another language L 2 if L 1 L 2 and L 1 L 2 Let

A language L1 is smaller than another language L2 if L1 ⊂ L2 and L1 ≠ L2• Let T be any language closed under concatenation; that is, if t1 ∈ T and t2 ∈ T. then t1 t2 is also an element of T. Show that if T contains S but T ≠ S*, then S* is smaller than T. We can summarize this by saying that S* is the smallest closed language containing S.

Step by Step Solution

3.38 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Answer and Explanation Assume that T contains S but ... View full answer

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 SQL Database Programming Questions!