Theoretical Computer Science, Volume 93

Volume 93, Number 1, 1992

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn: On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. 1-41
Sándor Vágvölgyi: Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. 43-74
György E. Révész: A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem. 75-89
Peter G. Harrison, Hessam Khoshnevisan: A New Approach to Recursion Removal. 91-113
V. S. Subrahmanian: Paraconsistent Disjunctive Deductive Databases. 115-141
Guo-Qiang Zhang: Stable Neighbourboods. 143-157
Andreas Goerdt: Unrestricted Resolution versus N-Resolution. 159-167

Pierre Péladeau: Logically Defined Subsets of N k. 169-183
Kunihiko Hiraishi, Atsunobu Ichikawa: On Structural Conditions for Weak Persistency and Semilinearity of Petri Nets. 185-199
Guy Louchard, B. Randrianarimanana, René Schott: Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis. 201-225
Paola Bonizzoni, Giancarlo Mauri: On Automata on Infinite Trees. 227-244
Zvi M. Kedem, Krishna V. Palem: Optimal Parallel Algorithms for Forest and Term Matching. 245-264
Seinosuke Toda: Restricted Relativizations of Probablistic Polynomial Time. 265-277
Prakash V. Ramanan: Testing the Optimality of Alphabetic Trees. 279-301
Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant: An Arithmetic Model of Computation Equivalent to Threshold Circuits. 303-319
Patrick Dehornoy: A Criterion for Proving Noetherianity of a Relation. 321-325
Thomas Herbst: On a Kind of Fatou Property of Context-Free Groups. 327-331