I am doing my computation theory assignment. It asks me to prove this regular language is closed: max(L) = {w | w is in L and for no x other than "epsilon" is wx in L} There is a hint as following: It is easiest to start with at DFA for L and perform a construction to get the desired language.
Can anyone give me some help on this? Or at least tell me what "w is in L and for no x other than "epsilon" is wx in L" means? Thank you so much!
Can anyone give me some help on this? Or at least tell me what "w is in L and for no x other than "epsilon" is wx in L" means? Thank you so much!
