This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1 ), where n the length of the word and...