A language L 1 is smaller than another language L 2 if L 1 L 2

Question:

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.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: