Lecture12-1_Part45 - For many CFL-s the PDA recognizing...

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

View Full Document Right Arrow Icon
Recall that every CFL is recognized by some PDA. It is not hard to prove that a TM can simulate a PDA, but this is not enough?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: For many CFL-s the PDA recognizing them is nondeterministic, which may cause the following problem: CFL-s are Decidable 45...
View Full Document

This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.

Ask a homework question - tutors are online