Lecture12-1_Part46

Lecture12-1_Part46 - every input. Nevertheless there is a...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Let L be a CFL, let p a be a PDA recognizing L and let w be a string such that . PDA P may never stop on w and a TM simulating P may loop while a decider should stop on
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: every input. Nevertheless there is a solution: Theorem Let L be a CFL. There exists a TM deciding L . CFL-s are Decidable 46 L w...
View Full Document

Ask a homework question - tutors are online