: Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will generalize this result for formal power series. We will also give a new proof o...
This position paper describes an approach to predict the performances of a Web application already in the early stages of application development. It leverages the wealth of inform...
We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of forma...
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...