The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1982, volume: 18, number:

  1. C. Pair
    Abstract Data Types and Algebraic Semantics of Programming Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:1-31 [Journal]
  2. Jonathan Goldstine, John K. Price, Detlef Wotschke
    A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:33-40 [Journal]
  3. Andrei P. Ershov
    Mixed Computation: Potential Applications and Problems for Study. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:41-67 [Journal]
  4. Johann Hagauer
    On Form-Equivalence of Deterministic pure Grammar Forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:69-87 [Journal]
  5. Georg Schnitger
    A Family of Graphs with Expensive Depth Reduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:89-93 [Journal]
  6. Uwe Schöning
    A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:95-103 [Journal]
  7. Martin Fürer
    The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:105-111 [Journal]
  8. Jean Berstel, Christophe Reutenauer
    Recognizable Formal Power Series on Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:115-148 [Journal]
  9. Eike Best
    Adequacy Properties of Path Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:149-171 [Journal]
  10. Frédéric Boussinot
    Proposition de Semantique Denotationelle pour des Reseaux de Processus avec Operateur de Melange Equitable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:173-206 [Journal]
  11. Keisuke Uchimura
    Properties of Structure Generating Functions of Automata and their Applications for Linear Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:207-220 [Journal]
  12. Maxime Crochemore
    Sharp Characterizations of Squarefree Morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:221-226 [Journal]
  13. Joseph Sifakis
    A Unified Approach for Studying the Properties of Transition Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:227-258 [Journal]
  14. Daniel Leivant
    Unprovability of Theorems of Complexity Theory in Weak Number Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:259-268 [Journal]
  15. Akira Maruoka, Masayuki Kimura
    Strong Surjectivity is Equivalent to C-Injectivity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:269-277 [Journal]
  16. Karel Culik II, Tero Harju
    Dominoes Over a Free Monoid. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:279-300 [Journal]
  17. Albert R. Meyer, Karl Winklmann
    Expressing Program Looping in Regular Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:301-323 [Journal]
  18. Ronald V. Book
    When is a Monoid a Group? The Church-Rosser Case is Tractable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:325-331 [Journal]
  19. Sorin Istrail
    Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:333-341 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002