
Let L be be a language over the alphabet fa, b, c) recognised by NFA Consider the language L’ such that every string w’ E L’ is obtained from a string w L by replacing all occurrences of c in w by a. Prove that L’ is NFA
PayPal Gateway not configured
PayPal Gateway not configured