Journals in DBLP

Theor. Comput. Sci.
1983, volume: 27, number:

1. Harry B. Hunt III, Daniel J. Rosenkrantz
   The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:3-38 [Journal]
   
2. Tsutomu Kamimura, Adrian Tang
   Algebraic Relations and Presentations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:39-60 [Journal]
   
3. Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
   Two-Dimensional Alternating Turing Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:61-83 [Journal]
   
4. Grzegorz Rozenberg, R. Verraedt
   Subset Languages of Petri Nets Part II: Closure Properties. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:85-108 [Journal]
   
5. Michael B. Smyth
   The Largest Cartesian Closed Category of Domains. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:109-119 [Journal]
   
6. Pavol Duris, Juraj Hromkovic
   One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:121-125 [Journal]
   
7. Joseph Y. Halpern, John H. Reif
   The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:127-165 [Journal]
   
8. Hans-Dieter Ehrich, Udo W. Lipeck
   Algebraic Domain Equations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:167-196 [Journal]
   
9. Alexei P. Stolboushkin, Michael A. Taitslin
   The Comparison of the Expressive Power of First-Order Dynamic Logics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:27, n:, pp:197-209 [Journal]
   
10. Symeon Bozapalidis, Olympia Louscou-Bozapalidou
    The Rank of a Formal Tree Power Series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:211-215 [Journal]
    
11. Akira Maruoka
    Open Maps for Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:217-224 [Journal]
    
12. Jirí Adámek, Evelyn Nelson
    Separately Continuous Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:225-231 [Journal]
    
13. David P. Dobkin, David G. Kirkpatrick
    Fast Detection of Polyhedral Intersection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:241-253 [Journal]
    
14. Hartmut Ehrig, Hans-Jörg Kreowski
    Compatibility of Parameter Passing and Implementation of Parameterized Data Types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:255-286 [Journal]
    
15. Norbert Blum
    More on the Power of Chain Rules in Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:287-295 [Journal]
    
16. Robert D. Tennent
    Semantics of Interference Control. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:297-310 [Journal]
    
17. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
    On Regularity of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:311-332 [Journal]
    
18. Dexter Kozen
    Results on the Propositional mu-Calculus. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:333-354 [Journal]