Journals in DBLP

Theor. Comput. Sci.
1981, volume: 14, number:

1. Georg Gato
   Some Elements of a Galois Theory of the Structure and Complexity of the Tree Automorphism Problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:1-17 [Journal]
   
2. Jürgen Schulte Mönting
   Merging of 4 or 5 Elements with n Elements. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:19-37 [Journal]
   
3. Yasuaki Nishitani, Namio Honda
   The Firing Squad Synchronization Problem for Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:39-61 [Journal]
   
4. Ernst L. Leiss
   On Generalized Language Equations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:63-77 [Journal]
   
5. Arnon Rosenthal
   Optimal Algorithms for Sensitivity Analysis in Associative Multiplication Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:79-90 [Journal]
   
6. Timothy J. Long
   On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:91-101 [Journal]
   
7. Zvi Galil
   On the Theoretical Efficiency of Various Network Flow Algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:103-111 [Journal]
   
8. Dexter Kozen, Rohit Parikh
   An Elementary Proof of the Completness of PDL. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:113-118 [Journal]
   
9. Michel Latteux
   A Propos du Lemme de Substitution. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:14, n:, pp:119-123 [Journal]
   
10. Matthias Jantzen
    The Power of Synchronizing Operations on Strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:127-154 [Journal]
    
11. Jean H. Gallier
    DPDA's in `Atomic Normal Form' and Applications to Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:155-186 [Journal]
    
12. Joffroy Beauquier
    Substitution of Semi-AFL'S. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:187-193 [Journal]
    
13. Denis Thérien
    Classification of Finite Monoids: The Language Approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:195-208 [Journal]
    
14. Akira Maruoka, Masayuki Kimura, Nobuyoshi Shoji
    Pattern Decomposition for Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:211-226 [Journal]
    
15. Walter Bucher, Hermann A. Maurer, Karel Culik II, Detlef Wotschke
    Concise Description of Finite Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:227-246 [Journal]
    
16. Janusz Stoklosa, Wojciech Zakowski
    Computations of (alpha, k)-Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:247-265 [Journal]
    
17. Grzegorz Rozenberg, R. Verraedt
    On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:267-288 [Journal]
    
18. Shlomo Moran
    General Approximation Algorithms for some Arithmetical Combinatorial Problems. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:289-303 [Journal]
    
19. G. Callegarin, Giuliano Pacini
    About the Implementability and the Power of Equationally Defined Data Abstractions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:305-315 [Journal]
    
20. Kurt Jensen
    Coloured Petri Nets and the Invariant-Method. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:317-336 [Journal]
    
21. Walter Bucher
    A Note on a Problem in the Theory of Grammatical Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:337-344 [Journal]