Essay title for SEM1A5

Due - noon on Tuesday of last week (week 12) of the second semester, (7th May 1996), in the School of Computer Science coursework pigeon holes.

Describe the Recursive Transition Network formalism showing its relationship to Finite State Transition Networks and its equivalence to Context Free Grammars. What are the advantages and disadvantages of Recursive Transition Networks?

Include a bibliography to show what books, articles, World-Wide Web pages you have used. You should write your references in a good style, perhaps susing that given in the University Library's handout entitled Preparing and quoting references and (for electronic sources) the WWW page at UCL.

P J Hancox
22 March 1995