Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             68 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A decidable propositional dynamic logic with explicit probabilities Feldman, Yishai A.
 1984
 1-2 p. 11-38
28 p.
 artikel
2 A formal notion of program-based test data adequacy Davis, Martin D.
 1983
 1-2 p. 52-71
20 p.
 artikel
3 A generalization of context-free determinism Hibbard, Thomas N.
 1967
 1-2 p. 196-238
43 p.
 artikel
4 Algebraic automata and context-free sets Mezei, J.
 1967
 1-2 p. 3-29
27 p.
 artikel
5 An approach for generating different types of gray codes Arazi, Benjamin
 1984
 1-2 p. 1-10
10 p.
 artikel
6 An area-maximum edge length trade-off for VSLI layout Blum, Norbert
 1985
 1-2 p. 45-52
8 p.
 artikel
7 An automata-theoretical characterization of the OI-hierarchy Damm, Werner
 1986
 1-2 p. 1-32
32 p.
 artikel
8 An exponential lower bound for real-time branching programs ák, Stanislav
 1986
 1-2 p. 87-94
8 p.
 artikel
9 An exponential number of generalized Kerdock codes Kantor, William M.
 1982
 1-2 p. 74-80
7 p.
 artikel
10 An extension of the entropy theorem for parameter estimation Minamide, Nariyasu
 1982
 1-2 p. 81-90
10 p.
 artikel
11 An ideal model for recursive polymorphic types MacQueen, David
 1986
 1-2 p. 95-130
36 p.
 artikel
12 Announcement 1982
 1-2 p. 139-140
2 p.
 artikel
13 A programming language for the inductive sets, and applications Harel, David
 1984
 1-2 p. 118-139
22 p.
 artikel
14 A proof rule for fair termination of guarded commands Grumberg, Orna
 1985
 1-2 p. 83-102
20 p.
 artikel
15 A representation theorem for algebraic and context-free power series in noncommuting variables Shamir, Eliahu
 1967
 1-2 p. 239-254
16 p.
 artikel
16 A selection from papers presented at the conference on the algebraic theory of machines, languages, and semigroups 1967
 1-2 p. 255-256
2 p.
 artikel
17 Automaton automorphisms Arbib, Michael A.
 1967
 1-2 p. 147-154
8 p.
 artikel
18 Call for papers 1984
 1-2 p. 140-141
2 p.
 artikel
19 Can message buffers be axiomatized in linear temporal logic? Sistla, A.P.
 1984
 1-2 p. 88-112
25 p.
 artikel
20 Derivational complexity of context-free grammars Sippu, Seppo
 1982
 1-2 p. 52-65
14 p.
 artikel
21 Direction independent context-sensitive grammars Kleijn, H.C.M.
 1984
 1-2 p. 113-117
5 p.
 artikel
22 Editorial Eden, Murray
 1967
 1-2 p. 1-
1 p.
 artikel
23 Editorial Board 1983
 1-2 p. i-
1 p.
 artikel
24 Editorial Board 1985
 1-2 p. i-
1 p.
 artikel
25 Editorial Board 1982
 1-2 p. i-
1 p.
 artikel
26 Editorial Board 1984
 1-2 p. i-
1 p.
 artikel
27 Editorial Board 1982
 1-2 p. i-
1 p.
 artikel
28 Editorial Board 1967
 1-2 p. i-
1 p.
 artikel
29 Editorial Board 1986
 1-2 p. i-
1 p.
 artikel
30 Fast probabilistic RAM simulation of single tape turing machine computations Robson, J.M.
 1984
 1-2 p. 67-87
21 p.
 artikel
31 Geometric retrieval problems Cole, Richard
 1984
 1-2 p. 39-57
19 p.
 artikel
32 Global and local invariants in transition systems Sifakis, Joseph
 1982
 1-2 p. 91-107
17 p.
 artikel
33 Ho's algorithm, commutative diagrams, and the uniqueness of minimal linear systems Zeiger, Paul
 1967
 1-2 p. 71-79
9 p.
 artikel
34 Implicit data structures for weighted elements Frederickson, Greg N.
 1985
 1-2 p. 61-82
22 p.
 artikel
35 Infinite-dimensional filtering: The Kalman\3-Bucy filter in Hilbert space Falb, Peter L.
 1967
 1-2 p. 102-137
36 p.
 artikel
36 Introduction Davis, Martin
 1982
 1-2 p. 1-
1 p.
 artikel
37 Isomorphism of graphs which are pairwise k-separable Miller, Gary L.
 1983
 1-2 p. 21-33
13 p.
 artikel
38 Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus Miller, Gary L.
 1983
 1-2 p. 1-20
20 p.
 artikel
39 Learning strategies Osherson, Daniel N.
 1982
 1-2 p. 32-51
20 p.
 artikel
40 Minimization theorems and techniques for sequential stochastic machines Paz, A.
 1967
 1-2 p. 155-166
12 p.
 artikel
41 On-line simulation of k + 1 tapes by k tapes requires nonlinear time Paul, W.
 1982
 1-2 p. 1-8
8 p.
 artikel
42 On relative completeness of Hoare logics Grabowski, Michal
 1985
 1-2 p. 29-44
16 p.
 artikel
43 On some characterizations of the Shannon entropy using extreme symmetry and block symmetry Prem, Nath
 1982
 1-2 p. 9-20
12 p.
 artikel
44 On the power of two-way random generators and the impossibility of deterministic poly-space simulation Karpinski, Marek
 1986
 1-2 p. 131-142
12 p.
 artikel
45 On the relationships between Scott domains, synchronization trees, and metric spaces Rounds, William C.
 1985
 1-2 p. 6-28
23 p.
 artikel
46 Optimal asymmetric error detecting codes Borden, J. Martin
 1982
 1-2 p. 66-73
8 p.
 artikel
47 Partial algorithm problems for context free languages Ullian, Joseph S.
 1967
 1-2 p. 80-101
22 p.
 artikel
48 Petri net implementations by a universal cell space Golze, Ulrich
 1982
 1-2 p. 121-138
18 p.
 artikel
49 Predicates definable over transformational derivations by intersection with regular languages Kimball, John P.
 1967
 1-2 p. 177-195
19 p.
 artikel
50 Processes and the denotational semantics of concurrency de Bakker, J.W.
 1982
 1-2 p. 70-120
51 p.
 artikel
51 Propositional dynamic logic of looping and converse is elementarily decidable Streett, Robert S.
 1982
 1-2 p. 121-141
21 p.
 artikel
52 Pseudo-extensions of computable functions Case, John
 1983
 1-2 p. 100-111
12 p.
 artikel
53 Recognition of surfaces in three-dimensional digital images Reed, George M.
 1982
 1-2 p. 108-120
13 p.
 artikel
54 Retraction map categories and their applications to the construction of lambda calculus models Yokouchi, Hirofumi
 1986
 1-2 p. 33-86
54 p.
 artikel
55 Some negative results on the computational complexity of total variation and differentiation Ker-I, Ko
 1982
 1-2 p. 21-31
11 p.
 artikel
56 Temporal logic can be more expressive Wolper, Pierre
 1983
 1-2 p. 72-99
28 p.
 artikel
57 Termination assertions for recursive programs: Completeness and axiomatic definability Meyer, Albert R.
 1983
 1-2 p. 112-138
27 p.
 artikel
58 The complexity of cubical graphs Afrati, Foto
 1985
 1-2 p. 53-60
8 p.
 artikel
59 The complexity of equivalence problems for commutative grammars Huynh, Dung T.
 1985
 1-2 p. 103-121
19 p.
 artikel
60 The complexity of the validity problem for dynamic logic Manders, Kenneth L.
 1982
 1-2 p. 48-69
22 p.
 artikel
61 The loop complexity of pure-group events McNaughton, Robert
 1967
 1-2 p. 167-176
10 p.
 artikel
62 The recognition of deterministic CFLs in small time and space von Braunmühl, Burchard
 1983
 1-2 p. 34-51
18 p.
 artikel
63 The recursion-theoretic complexity of the semantics of predicate logic as a programming language Blair, Howard A.
 1982
 1-2 p. 25-47
23 p.
 artikel
64 The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete Narendran, Paliath
 1984
 1-2 p. 58-66
9 p.
 artikel
65 Turing machines with a schedule to keep Fischer, Patrick C.
 1967
 1-2 p. 138-146
9 p.
 artikel
66 Two-way pushdown automata Gray, James N.
 1967
 1-2 p. 30-70
41 p.
 artikel
67 Unraveling k-page graphs Kannan, Ravi
 1985
 1-2 p. 1-5
5 p.
 artikel
68 Why Gödel didn't have church's thesis Davis, Martin
 1982
 1-2 p. 3-24
22 p.
 artikel
                             68 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland