Prove that the following two languages are undecidable. a.

Chapter , Problem 5.32

(choose chapter or problem)

Prove that the following two languages are undecidable.

a. \(O V E R L A P_{\mathrm{CFG}}=\{\langle G, H\rangle \mid G \text { and } H \text { are CFGs where } L(G) \cap L(H) \neq \emptyset\}\).
(Hint: Adapt the hint in Problem 5.21.)

b. \(P R E F I X-F R E E_{\mathrm{CFG}}=\{\langle G\rangle \mid G \text { is a CFG where } L(G) \text { is prefix-free }\}\)

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back