Journals in DBLP

Theor. Comput. Sci.
1984, volume: 32, number:

1. Jean-Claude Raoult
   On Graph Rewritings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:1-24 [Journal]
   
2. Nissim Francez, Daniel J. Lehmann, Amir Pnueli
   A Linear-History Semantics for Languages for Distributed Programming. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:25-46 [Journal]
   
3. Jürgen Duske, Rainer Parchmann
   Linear Indexed Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:47-60 [Journal]
   
4. Jürgen Avenhaus, Klaus Madlener
   The Nielsen Reduction and P-Complete Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:61-76 [Journal]
   
5. Francis Y. L. Chin, Peter Kossowski, S. C. Loh
   Efficient Inference Control for Range SUM Queries. [Citation Graph (3, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:77-86 [Journal]
   
6. Etsuji Tomita
   An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:87-120 [Journal]
   
7. Egidio Astesiano, Gerardo Costa
   Distributive Semantics for Nondeterministic Typed lambda-Calculi. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:121-156 [Journal]
   
8. Uzi Vishkin
   A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:157-172 [Journal]
   
9. Ken McAloon
   Petri Nets and Large Finite Sets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:32, n:, pp:173-183 [Journal]
   
10. David Maier, Jeffrey D. Ullman
    Connections in Acyclic Hypergraphs. [Citation Graph (6, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:185-199 [Journal]
    
11. T. E. Hall
    Biprefix Codes, Inverse Semigroups and Syntactic Monoids of Injective Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:201-213 [Journal]
    
12. Roy Meshulam
    A Geometric Construction of a Superconcentrator of Depth 2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:215-219 [Journal]
    
13. Jia-Wei Hong
    A Tradeoff Theorem for Space and Reversal. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:221-224 [Journal]
    
14. Karel Culik II, Sheng Yu
    Iterative Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:227-247 [Journal]
    
15. Friedrich Otto
    Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:249-260 [Journal]
    
16. Valtteri Niemi
    The Undecidability of Form Equivalence for Context-Free and E0L Forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:261-277 [Journal]
    
17. Jürgen Avenhaus, Klaus Madlener
    On the Complexity of Intersection and Conjugacy Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:279-295 [Journal]
    
18. Jussi Ketonen, Richard W. Weyhrauch
    A Decidable Fragment of Predicate Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:297-307 [Journal]
    
19. N. G. de Bruijn
    Some Machines Defined bu Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:309-319 [Journal]
    
20. Satoru Miyano, Takeshi Hayashi
    Alternating Finite Automata on omega-Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:321-330 [Journal]
    
21. Ludwig Staiger
    Projection Lemmas for omega-Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:331-337 [Journal]
    
22. Gérard Jacob, Christophe Reutenauer
    On Formal Power Series Defined by Infinite Linear Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:339-340 [Journal]