Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
We give a combinatorial formula for the inverses of the alternating sums of free quasi-symmetric functions of the form F(I) where I runs over compositions with parts in a prescribe...
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Practical use of MDL is full of pitfalls in which the practitioners tend to fall head over heels. We analyse the power and the perils in the use of MDL. Generally, the classical a...