The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1985, volume: 41, number:

  1. Gheorghe Paun
    A Variant of Random Context Grammars: Semi-Conditional Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:1-17 [Journal]
  2. Eric Goles Ch.
    Dynamics of Positive Automata Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:19-32 [Journal]
  3. Virgil Emil Cazanescu
    On Context-Free Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:33-50 [Journal]
  4. Philippe Gohon
    An Algorithm to Decide Whether a Rational Subset of N^k is Recognizable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:51-59 [Journal]
  5. Evelyne Barbin-Le Rest, Michel Le Rest
    Sur la Combinatoire des Codes à Deux Mots. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:61-80 [Journal]
  6. Costas S. Iliopoulos
    Computing in General Abelian Groups is Hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:81-93 [Journal]
  7. Susumu Hayashi
    Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:95-104 [Journal]
  8. Yael Maon
    On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:105-107 [Journal]
  9. Jean-Yves Thibon
    Integrité des Algèbres de Séries Formelles sur un Alphabet Partiellement Commutatif. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:109-112 [Journal]
  10. Martin W. Bunder
    Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:113-120 [Journal]
  11. Michael H. Albert, J. Lawrence
    A Proof of Ehrenfeucht's Conjecture. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:121-123 [Journal]
  12. Bettina Helfrich
    Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:125-139 [Journal]
  13. Burkhard Monien, Ivan Hal Sudborough
    Bandwidth Constrained NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:141-167 [Journal]
  14. Elias Dahlhaus, Haim Gaifman
    Concerning Two-Adjacent Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:169-184 [Journal]
  15. Wolfgang Reisig
    Petri Nets with Individual Tokens. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:185-213 [Journal]
  16. Juhani Karhumäki
    A Property of Three-Element Codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:215-222 [Journal]
  17. Etsuji Tomita, Kazushi Seino
    A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:223-230 [Journal]
  18. Oscar H. Ibarra, Michael A. Palis, Sam M. Kim
    Fast Parallel Language Recognition by Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:231-246 [Journal]
  19. Elisabeth Pelz
    On the Complexity of Theories of Permutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:247-269 [Journal]
  20. John Grant, Jack Minker
    Inferences for Numerical Dependencies. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:271-287 [Journal]
  21. Sachio Hirokawa
    Complexity of the Combinator Reduction Machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:289-303 [Journal]
  22. Giora Slutzki
    Alternating Tree Automata. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:305-318 [Journal]
  23. H.-J. Stoß
    The Complexity of Evaluating Interpolation Polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:319-323 [Journal]
  24. Friedhelm Meyer auf der Heide
    Simulating Probabilistic by Deterministic Algebraic Computation Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:325-330 [Journal]
  25. Katsushi Inoue, Itsuo Takanami, Roland Vollmar
    Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:331-339 [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