Journals in DBLP

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

1. Rani Siromoney, K. G. Subramanian, V. Rajkumar Dare
   Infinite Arrays and Controlled Deterministic Table 0L Array Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:3-11 [Journal]
   
2. Matthias Jantzen, Manfred Kudlek
   Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:13-43 [Journal]
   
3. Egidio Astesiano, Elena Zucca
   Parametric Channels via Label Expressions in CCS. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:45-63 [Journal]
   
4. Krzysztof R. Apt, Amir Pnueli, Jonathan Stavi
   Fair Termination Revisited-With Delay. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:65-84 [Journal]
   
5. Bala Ravikumar, K. B. Lakshmanan
   Coping with Known Patterns of Lies in a Search Game. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:85-94 [Journal]
   
6. Peter Dybjer
   Some Results on the Deductive Structure of Join Dependencies. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:95-105 [Journal]
   
7. C. E. Veni Madhavan
   Secondary Attribute Retrieval Using Tree Data Structures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:107-116 [Journal]
   
8. Victor Y. Pan
   The Technique of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:117-138 [Journal]
   
9. Manfred Broy, Martin Wirsing, C. Pair
   A Systematic Study of Models of Abstract Data Types. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:33, n:, pp:139-174 [Journal]
   
10. Stéphane Kaplan
    Conditional Rewrite Rules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:175-193 [Journal]
    
11. Elfriede Fehr
    Expressive Power of Typed and Type-Free Programming Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:195-238 [Journal]
    
12. Yael Maon, Amiram Yehudai
    On Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:239-260 [Journal]
    
13. Friedrich Otto
    Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:261-278 [Journal]
    
14. N. Soundararajan
    Denotational Semantics of CSP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:279-304 [Journal]
    
15. Dung T. Huynh
    Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:305-326 [Journal]
    
16. Tero Harju, Matti Linna
    The Equations h(w)=w-n in Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:327-329 [Journal]
    
17. Dominique Perrin, Paul E. Schupp
    Sur les Monoides À un Relateur qui sont des Groupes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:331-334 [Journal]
    
18. Danièle Beauquier
    Bilimites de Langages Reconnaissables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:335-342 [Journal]