CAAP
13 years 8 months ago
1994 
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
CTRS
13 years 8 months ago
1994  ECA
13 years 9 months ago
1994 MFCS
13 years 9 months ago
1994 Springer 
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
STACS
13 years 9 months ago
1994 Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
|
Theoretical Computer Science