Master Computer Science



The following thesis was written by a student in the 1994 class of the Master Computer Science programme at Leiden University.


Thesis details

TitleThe Decidability of the Boundedness of Functions on Hypergraph Generating Tree Grammars
StudentSchelvis, W.A.M. (Wilbert)
ProgrammeMaster Computer Science
Year1994
SupervisorsEngelfriet, dr. J. (Joost)
Thesis Open Thesis PDF

Citation details

Schelvis, W.A.M. (Wilbert), The Decidability of the Boundedness of Functions on Hypergraph Generating Tree Grammars, Thesis Master Computer Science, LIACS, Leiden University, 1994.