These webpages contain theses and reports by students affiliated with the various bachelor and master programmes offered at the Leiden Institute of Advanced Computer Science (LIACS), the computer science department of Leiden University.
The following thesis was written by a student in the 1994 class of the Master Computer Science programme at Leiden University.
|Title||The decidability of the boundedness of functions on hypergraph generating tree grammars|
|Programme||Master Computer Science|
|Thesis||Open Thesis PDF|
W.A.M. Schelvis, The decidability of the boundedness of functions on hypergraph generating tree grammars, Thesis Master Computer Science, Leiden University, 1994.