Journals in DBLP

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

1. Efim B. Kinber
   The Inclusion Problem for some Classes of Deterministic Multitape Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:1-24 [Journal]
   
2. Ivan Hal Sudborough
   Bandwidth Constraints on Problems Complete for Polynomial Time. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:25-52 [Journal]
   
3. J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker
   On Infinite Computations in Denotational Semantics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:53-82 [Journal]
   
4. Sorin Istrail, Cristian Masalagiu
   Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:83-103 [Journal]
   
5. Eric C. R. Hehner, C. A. R. Hoare
   A More Complete Model of Communicating Processes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:105-120 [Journal]
   
6. E. Allen Emerson
   Alternative Semantics for Temporal Logics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:121-130 [Journal]
   
7. Klaus Weihrauch, Gisela Schäfer
   Admissible Representations of Effective CPO's. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:131-147 [Journal]
   
8. Seymour Ginsburg, Richard Hull
   Order Dependency in the Relational Model. [Citation Graph (4, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:149-195 [Journal]
   
9. Oscar H. Ibarra, Louis E. Rosier
   Simple Programming Languages and Restricted Classes of Turing Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:26, n:, pp:197-220 [Journal]
   
10. André Arnold
    Rational omega-Languages are Non-Ambiguous. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:221-223 [Journal]
    
11. Vaclav Rajlich
    Determinism in Parallel Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:225-231 [Journal]
    
12. Walter Bucher, Johann Hagauer
    It is Decidable Whether a Regular Language is Pure Context-Free. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:233-241 [Journal]
    
13. Seymour Ginsburg, Richard Hull
    Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:243-286 [Journal]
    
14. Chee-Keng Yap
    Some Consequences of Non-Uniform Conditions on Uniform Classes. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:287-300 [Journal]
    
15. Grzegorz Rozenberg, R. Verraedt
    Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:301-326 [Journal]
    
16. Stanislav Zák
    A Turing Machine Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:327-333 [Journal]
    
17. Juris Hartmanis
    On Gödel Speed-Up and Succinctness of Language Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:335-342 [Journal]
    
18. John Staples, V. L. Nguyen
    Computing the Behaviour of Asynchronous Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:343-353 [Journal]