83
Voted
TCS
1998
15 years 23 hour ago
1998
We prove that bisimulation equivalence is decidable for normed pushdown processes.
TCS
1998
15 years 23 hour ago
1998
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
104
Voted
TCS
1998
15 years 23 hour ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
82
Voted
TCS
1998
15 years 23 hour ago
1998
TCS
1998
15 years 23 hour ago
1998
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
TCS
1998
15 years 23 hour ago
1998
The hypercube is a widely used interconnection topology as it presents a lot of attractive properties. Recently, the hypercube has been proposed as a virtual topology for TWDM mul...
87
Voted
TCS
1998
15 years 23 hour ago
1998
102
Voted
TCS
1998
15 years 23 hour ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
61
Voted
TCS
1998
15 years 23 hour ago
1998
86
Voted
TCS
1998
15 years 23 hour ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...