Replies
Welcome, guest
Join CrazyEngineers to reply, ask questions, and participate in conversations.
CrazyEngineers powered by Jatra Community Platform
-
@thebigk • Aug 20, 2010
Try this link: <a href="https://www.google.com/search?ie=UTF-8&oe=UTF-8&sourceid=navclient&gfns=1&q=A+function+is+computable+iff+markov+chain+is+recursive" target="_blank" rel="noopener noreferrer">A function is computable iff markov chain is recursive - Google Search</a> - Google search results for the proof. Does that help?
-
@phani987-o9cYeI • Aug 20, 2010
Thank you and One more Question
proof required:
If a language L is deterministically context free language then L is not inherently ambiguous