Volume 39,
1985
- Christiane Frougny:
Context-Free Grammars with Cancellation Properties.
3-13
- Jean-Louis Lassez, Michael J. Maher:
Optimal Fixedpoints of Logic Programs.
15-25
- Colin Stirling:
A Proof-Theoretic Characterization of Observational Equivalence.
27-45
- Ralph-Johan Back, Heikki Mannila:
On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes.
47-68
- R. Kannan:
Solving Systems of Linear Equations over Polynomials.
69-88
- Oscar H. Ibarra, Michael A. Palis, Jik H. Chang:
On Efficient Recognition of Transductions and Relations.
89-106
- Lutz Priese:
On a Fast Decomposition Method in Some Models of Concurrent Computations.
107-121
- Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton:
The Church-Rosser Property and Special Thue Systems.
123-133
- Corrado Böhm, Alessandro Berarducci:
Automatic Synthesis of Typed Lambda-Programs on Term Algebras.
135-154
- Michel Parigot, Elisabeth Pelz:
A Logical Approach of Petri Net Languages.
155-169
- Jean-Claude Spehner:
Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht.
171-188
- Mario Rodríguez-Artalejo:
Some Questions about Expressiveness and Relative Completeness in Hoare's Logic.
189-206
- Stephen R. Mahaney, Paul Young:
Reductions Among Polynomial Isomorphism Types.
207-224
- Deborah Joseph, Paul Young:
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP.
225-237
- Richard Hull:
Non-Finite Specifiability of Projections of Functional Dependency Families.
239-265
- Jörg Vogel, Klaus Wagner:
Two-Way Automata with More than one Storage Medium.
267-280
- Rani Siromoney, V. Rajkumar Dare:
On Infinite Words Obtained by Selective Substitution Grammars.
281-295
- Armin Haken:
The Intractability of Resolution.
297-308
- Seymour Ginsburg, Edwin H. Spanier:
On Completing Tables to Satisfy Functional Dependencies.
309-317
- Ronald V. Book, Friedrich Otto:
On the Security of Name-Stamp Protocols.
319-325
- Ernst L. Leiss:
On Solving Star Equations.
327-332
- André Arnold:
A Syntactic Congruence for Rational omega-Language.
333-335
- Martin W. Bunder:
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators.
337-342
- Joos Heintz:
Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields.
343 ->TCS 24(3):
239-277 (1983)
Copyright © Tue Nov 10 01:05:29 2009
by Michael Ley (ley@uni-trier.de)
