Lecture12-1_Part43

Lecture12-1_Part43 - Theorem EQ CFG is an undecidable...

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

View Full Document Right Arrow Icon
Consider the language Unlike DFA-s CFL-s are not closed under intersection and complementation. Therefore we cannot decide EQ CFG using the method we used for EQ CFG . In the near future we will prove:
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Theorem EQ CFG is an undecidable language. CFG Equivalence is not Decidable 43 ( ) ( ) { } H L G L H G H G EQ CFG = | = and s-CFG are and ,...
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