P. 1
97144-11130-automata

97144-11130-automata

|Views: 1,570|Likes:
Published by Mike Corpus

More info:

Published by: Mike Corpus on Oct 01, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

02/16/2013

pdf

text

original

The parse tree for a grammar G in CNF will be a binary tree. Let k = 2n+1, where n
is the number of variables of G. Suppose z∈ L(G) and |z| ≥ k. Any parse tree for z
must be of depth at least n+1. The longest path in the parse tree is at least n+1, so
this path must contain at least n+1 occurrences of the variables. By pigeonhole
principle, some variables occur more than once along the path. Reading from
bottom to top, consider the first pair of same variable along the path. Say X has 2
occurrences. Break z into uvwxy such that w is the string of terminals generated at
the lower occurrence of X and vwx is the string generated by upper occurrence of
X.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->