| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Any iteration for polynomial equations using linear information has infinite complexity
|
Wasilkowski, G.W.
|
|
1983
|
22 |
1-2 |
p. 195-208
14 p.
|
artikel
|
| 2 |
Constructing a realtime deterministic pushdown automaton from a grammar
|
Pittl, Jan
|
|
1983
|
22 |
1-2 |
p. 57-69
13 p.
|
artikel
|
| 3 |
Curry's type-rules are complete with respect to the F-semantics too
|
Hindley, Roger
|
|
1983
|
22 |
1-2 |
p. 127-133
7 p.
|
artikel
|
| 4 |
Editorial Board
|
|
|
1983
|
22 |
1-2 |
p. ii-
1 p.
|
artikel
|
| 5 |
(g 0, g 1, …, gk )-trees and unary OL systems
|
Lee, D.T.
|
|
1983
|
22 |
1-2 |
p. 209-217
9 p.
|
artikel
|
| 6 |
Infinite linear systems and one counter languages
|
Kuich, W.
|
|
1983
|
22 |
1-2 |
p. 95-126
32 p.
|
artikel
|
| 7 |
Membership problem for embedded multivalued dependencies under some restricted conditions
|
Ito, Minoru
|
|
1983
|
22 |
1-2 |
p. 175-193
19 p.
|
artikel
|
| 8 |
On the relation between descriptional complexity and algorithmic probability
|
Gács, Péter
|
|
1983
|
22 |
1-2 |
p. 71-93
23 p.
|
artikel
|
| 9 |
Recursion induction principle revisited
|
Boudol, Gérard
|
|
1983
|
22 |
1-2 |
p. 135-173
39 p.
|
artikel
|
| 10 |
Systolic trees and systolic language recognition by tree automata
|
Steinby, Magnus
|
|
1983
|
22 |
1-2 |
p. 219-232
14 p.
|
artikel
|
| 11 |
The completeness theorem for typing λ-terms
|
Hindley, Roger
|
|
1983
|
22 |
1-2 |
p. 1-17
17 p.
|
artikel
|
| 12 |
Theory of symbolic expressions, I
|
Sato, Masahiko
|
|
1983
|
22 |
1-2 |
p. 19-55
37 p.
|
artikel
|
Tijdschrift beschrijving