Question: Given a TG for some arbitrary language L, what language would it accept if every + state were to be connected back to every -
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,

I bb ba b ab a becomes bb ba .1 ab
Step by Step Solution
3.39 Rating (161 Votes )
There are 3 Steps involved in it
If every state were connected back to every state by edges then the lang... View full answer
Get step-by-step solutions from verified subject matter experts
