Journals in DBLP

Theor. Comput. Sci.
1977, volume: 4, number: 1

1. Robin Milner
   Fully Abstract Models of Typed lambda-Calculi. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:1-22 [Journal]
   
2. Zvi Galil
   On the Complexity of Regular Resolution and the Davis-Putnam Procedure. [Citation Graph (1, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:23-46 [Journal]
   
3. Marcel Paul Schützenberger
   Sur une Variante des Fonctions Sequentielles. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:47-57 [Journal]
   
4. Daniel J. Lehmann
   Algebraic Structures for Transitive Closure. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:59-76 [Journal]
   
5. Jean Vuillemin
   Comment Verifier l'Associativite d'une Table de Groupe. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:77-82 [Journal]
   
6. Matti Linna
   A Decidability Result for Deterministic omega-Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:83-98 [Journal]
   
7. Toshiro Araki, Tadao Kasami
   Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:99-119 [Journal]
   
8. Shimon Even, Robert Endre Tarjan
   Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1977, v:4, n:1, pp:123- [Journal]