Theoretical Computer Science, Volume 67

Volume 67, Number 1, 1989

Vadim E. Kotov, J. Pottossine: Andrei P. Ershov 1931-1988. 1-4
Charles Swart, Dana S. Richards: On the Inference of Strategies. 5-18
Friedrich Otto: On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity. 19-35
Ursula Martin: A Geometrical Approach to Multiset Orderings. 17-54
Michael Clausen: Fast Generalized Fourier Transforms. 55-63
Danièle Beauquier: Minimal Automaton for a Factorial, Transitive and Rational Language. 65-73
Etsuro Moriya: A Grammatical Characterization of Alternating Pushdown Automata. 75-85
Gabriele Marongiu, Sauro Tulipani: On a Conjecture of Bergstra and Tucker. 87-97
Katsushi Inoue, Itsuo Takanami, Juraj Hromkovic: A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. 99-110
Dana Pardubská, Ivana Stefáneková: Nondeterministic Multicounter Machines and Complementation. 111-113
Michel Cosnard, Jean Duprat, Afonso Ferreira: Complexity of Selection in X + Y. 105-120
Catherine Petuaud: Entropie Topologique des Systemes Specifies. 121-128
Ramón Pino Pérez: Decidability of the Restriction Equational Theory in the Partial Lambda Calculus. 129-139

Klaus Madlener, Friedrich Otto: About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. 143-172
Leo Bachmair, Nachum Dershowitz: Completion for Rewriting Modulo a Congruence. 173-201
Jean H. Gallier, Wayne Snyder: Complete Sets of Transformations for General E-Unification. 203-260
Christine Choppy, Stéphane Kaplan, Michèle Soria: Complexity Analysis of Term-Rewriting Systems. 261-282
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland: Term-Rewriting Systems with Rule Priorities. 283-301
Hélène Kirchner: Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes. 303-332