"@ Irfan Khalid
Second Question is
Given a TM M and a string w, can we answer the question that whether M loops forever on w or not? Prove the problem decidable or undecidable.
As per my humble opinion, it is related to HaltTM problem given…"
"Thank you Zainab for much needed clarification.
However, along with accepted strings, I suggest to also take couple of strings that won't be accepted by FA and show that these can't be produced using CFG. in this case examples are ba, baba"
"Please share the reference in Handout if it is mentioned somewhere that RE is the way to prove equivalence.
My humble opinion says that we have to give some strings that can be both produced by CFG and accepted by FA in this case e.g.…"
Specialization (Like HRM, Management, Finance, Marketing, Banking, MIS etc)
VUSTUDENTS is strictly for educational assistance to students of Virtual University of Pakistan and other educational institutes. Offensive, adult content, advertisement, spamming, promotion of other sites & groups, sharing contact details publically, violation of Moral & Ethical Code of Conduct will not be permitted. Non-Compliance to any of these will result in deletion of profile without warning. Do you Agree ?
You need to be a member of Virtual University of Pakistan to add comments!
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at email@example.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.