Journals in DBLP

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

1. Sheila A. Greibach
   Remarks on the Complexity of Nondeterministic Counter Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:269-288 [Journal]
   
2. Claus-Peter Schnorr
   The Combinational Complexity of Equivalence. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:289-295 [Journal]
   
3. Emily P. Friedman
   The Inclusion Problem for Simple Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:297-316 [Journal]
   
4. Juhani Karhumäki
   Two Theorems Concerning Recognizable N-Subsets of sigma*. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:317-323 [Journal]
   
5. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum
   A Relationship between ET0L and EDT0L Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:325-330 [Journal]
   
6. V. Wiktor Marek, Zdzislaw Pawlak
   Information Storage and Retrieval Systems: Mathematical Foundations. [Citation Graph (5, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:331-354 [Journal]
   
7. Michael L. Fredman
   How Good is the Information Theory Bound in Sorting? [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1976, v:1, n:4, pp:355-361 [Journal]