Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
The asynchronous systems f are the models of the asynchronous circuits from digital electrical engineering. They are multi-valued functions that associate to each input u : R {0, ...
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...