nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Admissible representations of effective cpo's
|
Weihrauch, K. |
|
1983 |
26 |
1-2 |
p. 131-147 17 p. |
artikel |
2 |
Alternative semantics for temporal logics
|
Emerson, E.Allen |
|
1983 |
26 |
1-2 |
p. 121-130 10 p. |
artikel |
3 |
A more complete model of communicating processes
|
Hehner, E.C.R. |
|
1983 |
26 |
1-2 |
p. 105-120 16 p. |
artikel |
4 |
Bandwidth constraints on problems complete for polynomial time
|
Sudborough, Ivan Hal |
|
1983 |
26 |
1-2 |
p. 25-52 28 p. |
artikel |
5 |
Determinism in parallel systems
|
Rajlich, Vaclav |
|
1983 |
26 |
1-2 |
p. 225-231 7 p. |
artikel |
6 |
Editorial Board
|
|
|
1983 |
26 |
1-2 |
p. ii- 1 p. |
artikel |
7 |
It is decidable whether a regular language is pure context-free
|
Bucher, W. |
|
1983 |
26 |
1-2 |
p. 233-241 9 p. |
artikel |
8 |
Nivat's processing systems: decision problems related to protection and synchronization
|
Istrail, S |
|
1983 |
26 |
1-2 |
p. 83-103 21 p. |
artikel |
9 |
On finite computations in denotational semantics
|
de Bakker, J.W. |
|
1983 |
26 |
1-2 |
p. 53-82 30 p. |
artikel |
10 |
Order dependency in the relational model
|
Ginsburg, Seymour |
|
1983 |
26 |
1-2 |
p. 149-195 47 p. |
artikel |
11 |
Rational Ω-languages are non-ambiguous
|
Arnold, André |
|
1983 |
26 |
1-2 |
p. 221-223 3 p. |
artikel |
12 |
Simple programming languages and restricted classes of turing machines
|
Ibarra, Oscar H. |
|
1983 |
26 |
1-2 |
p. 197-220 24 p. |
artikel |
13 |
The inclusion problem for some classes of deterministic multitape automata
|
Kinber, E.B. |
|
1983 |
26 |
1-2 |
p. 1-24 24 p. |
artikel |