We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
We show how an object-oriented system-and in particular the Oberon System-can be used to write software that is extensible by end users even while the software is running. Extensib...
The static modifier is a convenient way to make class members "global" in object-oriented software systems. Given this, we wondered if static members significantly contr...
The paper is concerned with increasing our understanding of creative expertise drawing upon studies of collaboration between technologists and artists. The nature of expertise in c...