nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of automata and a direct product decomposition
|
Masunaga, Yoshifumi |
|
1976 |
13 |
1 |
p. 74-89 16 p. |
artikel |
2 |
A nonlinear lower bound on linear search tree programs for solving knapsack problems
|
Dobkin, David |
|
1976 |
13 |
1 |
p. 69-73 5 p. |
artikel |
3 |
A result on the equivalence problem for deterministicpushdown automata
|
Taniguchi, Kenichi |
|
1976 |
13 |
1 |
p. 38-50 13 p. |
artikel |
4 |
Complexity-class-encoding sets
|
Lynch, Nancy |
|
1976 |
13 |
1 |
p. 100-118 19 p. |
artikel |
5 |
Computation sequence sets
|
Peterson, James L. |
|
1976 |
13 |
1 |
p. 1-24 24 p. |
artikel |
6 |
Context-free grammars with graph-controlled tables
|
Rozenberg, G. |
|
1976 |
13 |
1 |
p. 90-99 10 p. |
artikel |
7 |
On the sequential nature of functions
|
Fischer, Patrick C. |
|
1976 |
13 |
1 |
p. 51-68 18 p. |
artikel |
8 |
Storage requirements for deterministic polynomialtime recognizable languages
|
Cook, Stephen |
|
1976 |
13 |
1 |
p. 25-37 13 p. |
artikel |