Journals in DBLP
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 ] Eric Goles Ch. Dynamics of Positive Automata Networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:19-32 [Journal ] Virgil Emil Cazanescu On Context-Free Trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:33-50 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Wolfgang Reisig Petri Nets with Individual Tokens. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:185-213 [Journal ] 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 ] 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 ] 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 ] 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 ] John Grant , Jack Minker Inferences for Numerical Dependencies. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:271-287 [Journal ] Sachio Hirokawa Complexity of the Combinator Reduction Machine. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:289-303 [Journal ] Giora Slutzki Alternating Tree Automata. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:305-318 [Journal ] 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 ] 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 ] 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 ]