CMSC 452, SPRING 2010 HOMEPAGE
This is a PhD thesis that has in the beginning a full proof of the Decidability of WS1S (the theory I talked about in class). You DO NOT want to kill trees by printing out the whole thing, but you may want to print out the pages 8-28, or read it on screen. ws1S.PDF,
This is a short writeup of the algorithm to get rid of useless nonterminals: useless.PDF,
This is a short writeup of the algorithm to get rid of unit productions: unit.PDF,
This is a short writeup of the algorithm to put a grammar in Chomsky Normal Form: chomsky.PDF,