Given a TG for some arbitrary language L, what language would it accept if every + state

Question:

Given a TG for some arbitrary language L, what language would it accept if every + state were to be connected back to every - state by Λ-edges? For example, by this method,

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

Step by Step Answer:

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