|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
29 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus |
Hayashi, Susumu |
1985 |
41 | C |
p. 95-104 10 p. |
artikel |
|
| 2 | Algorithms to construct minkowski reduced and hermite reduced lattice bases |
Helfrich, Bettina |
1985 |
41 | C |
p. 125-139 15 p. |
artikel |
|
| 3 | Alternating on-line turing machines with only universal states and small space bounds |
Inoue, Katsushi |
1985 |
41 | C |
p. 331-339 9 p. |
artikel |
|
| 4 | Alternating tree automata |
Slutzki, Giora |
1985 |
41 | C |
p. 305-318 14 p. |
artikel |
|
| 5 | An algorithm to decide whether a rational subset of N k is recognizable |
Gohon, Philippe |
1985 |
41 | C |
p. 51-59 9 p. |
artikel |
|
| 6 | Annoucement |
1985 |
41 | C |
p. 341-342 2 p. |
artikel |
||
| 7 | A proof of Ehrenfeucht's Conjecture |
Albert, M.H. |
1985 |
41 | C |
p. 121-123 3 p. |
artikel |
|
| 8 | A property of three-element codes |
Karhumäki, Juhani |
1985 |
41 | C |
p. 215-222 8 p. |
artikel |
|
| 9 | Author index volume 41 (1985) |
1985 |
41 | C |
p. 347- 1 p. |
artikel |
||
| 10 | A variant of random context grammars: Semi-conditional grammars |
Pǎun, Gheorghe |
1985 |
41 | C |
p. 1-17 17 p. |
artikel |
|
| 11 | A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable |
Tomita, Etsuji |
1985 |
41 | C |
p. 223-230 8 p. |
artikel |
|
| 12 | Bandwidth constrained NP-complete problems |
Monien, Burkhard |
1985 |
41 | C |
p. 141-167 27 p. |
artikel |
|
| 13 | Complexity of the combinator reduction machine |
Hirokawa, Sachio |
1985 |
41 | C |
p. 289-303 15 p. |
artikel |
|
| 14 | Computing in general abelian groups is hard |
Iliopoulos, Costas S. |
1985 |
41 | C |
p. 81-93 13 p. |
artikel |
|
| 15 | Concerning two-adjacent context-free languages |
Dahlhaus, E. |
1985 |
41 | C |
p. 169-184 16 p. |
artikel |
|
| 16 | Contents EATCS bulletin No. 28, February 1986 |
1985 |
41 | C |
p. 343-345 3 p. |
artikel |
||
| 17 | Dynamics of positive automata networks |
Goles Ch, E. |
1985 |
41 | C |
p. 19-32 14 p. |
artikel |
|
| 18 | Editorial Board |
1985 |
41 | C |
p. iii-iv nvt p. |
artikel |
||
| 19 | Fast parallel language recognition by cellular automata |
Ibarra, Oscar H. |
1985 |
41 | C |
p. 231-246 16 p. |
artikel |
|
| 20 | Inferences for numerical dependencies |
Grant, John |
1985 |
41 | C |
p. 271-287 17 p. |
artikel |
|
| 21 | Integrité des algèbres de séries formelles sur un alphabet partiellement commutatif |
Thibon, Jean-Yves |
1985 |
41 | C |
p. 109-112 4 p. |
artikel |
|
| 22 | On context-free trees |
Cǎzǎnescu, Virgil Emil |
1985 |
41 | C |
p. 33-50 18 p. |
artikel |
|
| 23 | On the complexity of theories of permutations |
Pelz, Elisabeth |
1985 |
41 | C |
p. 247-269 23 p. |
artikel |
|
| 24 | On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages |
Maon, Yael |
1985 |
41 | C |
p. 105-107 3 p. |
artikel |
|
| 25 | Petri nets with individual tokens |
Reisig, Wolfgang |
1985 |
41 | C |
p. 185-213 29 p. |
artikel |
|
| 26 | Possible forms of evaluation or reduction in Martin-Löf type theory |
Bunder, M.W. |
1985 |
41 | C |
p. 113-120 8 p. |
artikel |
|
| 27 | Simulating probabilistic by deterministic algebraic computation trees |
Meyer auf der Heide, Friedhelm |
1985 |
41 | C |
p. 325-330 6 p. |
artikel |
|
| 28 | Sur la combinatoire des codes à deux mots |
Rest, Evelyne Barbin-le |
1985 |
41 | C |
p. 61-80 20 p. |
artikel |
|
| 29 | The complexity of evaluating interpolation polynomials |
Stoss, H.-J. |
1985 |
41 | C |
p. 319-323 5 p. |
artikel |
29 gevonden resultaten