PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Viewing Version 2 of 'Chomsky normal form'
[ view 'Chomsky normal form' | back to history ]

Title of object: Chomsky normal form
Canonical Name: ChomskyNormalForm
Type: Definition

Created on: 2006-10-28 21:04:21
Modified on: 2006-10-28 22:25:28

Creator: rspuzio
Modifier: CWoo
Author: Mathprof
Author: rspuzio

Classification: msc:68Q45, msc:68Q42

Preamble:

% this is the default PlanetMath preamble. as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here
Content:

A grammar is said to be of \emph{Chomsky normal form} if every production
has either the form
\[A \to BC \]
where $A,B,C$ are non-terminal symbols or the form
\[A \to a \]
where $A$ is a terminal symbol and $a$ is a normal symbol.

Grammars of this sort are context-free, hence they describe context-free
languages. Moreover, given any context-free language, there exists a
Chomsky normal form grammar which describes it.