Lecture12-1_Part37

Lecture12-1_Part37 - Chomsky normal form(CNF if every rule...

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

View Full Document Right Arrow Icon
The way to solve this problem is by using the following definition and theorem: Definition A context-free grammar is in
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Chomsky normal form (CNF) if every rule is of the form: Decidable CFG Related Languages 37 a A BC A → →...
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