Lecture12-1_Part35

Lecture12-1_Part35 - 35 { } w G w G A CFG generating CFG a...

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

View Full Document Right Arrow Icon
Now we consider the language and prove: Theorem A CFG is a decidable language. Decidable CFG Related Languages
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 35 { } w G w G A CFG generating CFG a is , | =...
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