Volume 103, Number 1, 1992

Selected Papers of the 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS'90), Rouen, France, February 22-24, 1990

• 
  Richard Beigel, John Gill: Counting Classes: Thresholds, Parity, Mods, and Fewness. 3-23
• 
  Jin-yi Cai, Anne Condon, Richard J. Lipton: On Games of Incomplete Information. 25-38
• 
  Mireille Clerbout, Yves Roos: Semicommutations and Algebraic Languages. 39-49
• 
  Andrea Corradini, Ugo Montanari: An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs. 51-106
• 
  Gautam Das, Deborah Joseph: Minimum Vertex Hulls for Polyhedral Domains. 107-135
• 
  Jean-Luc Lambert: Sorting the Sums (xi+yj) in O(n2) Comparisons. 137-141
• 
  Wolfgang Thomas: Infinite Trees and Automation-Definable Relations over omega-Words. 143-159

Volume 103, Number 2, 1992

• 
  Michel Bauderon: Infinite Hypergraphs II: Systems of Recursive Equations. 165-190
• 
  Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima: Infinity-Regular Temporal Logic and its Model Checking Problem. 191-204
• 
  Luigi Palopoli: Testing Logic Programs for Local Stratification. 205-234
• 
  Matthias Felleisen, Robert Hieb: The Revised Report on the Syntactic Theories of Sequential Control and State. 235-271
• 
  Masahito Kurihara, Azuma Ohuchi: Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors. 273-282
• 
  Byeong Man Kim, Jung Wan Cho: A New Subsumption Method in the Connection Graph Proof Procedure. 283-309
• 
  Carl A. Gunter: The Mixed Powerdomain. 311-334
• 
  Andrea Maggiolo-Schettini, Józef Winkowski: Towards an Algebra for Timed Behaviours. 335-363
• 
  V. Wiktor Marek, V. S. Subrahmanian: The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs. 365-386
• 
  Harry G. Mairson: A Simple Proof of a Theorem of Statman. 387-394
• 
  Thomas Streicher: Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions. 395-408
• 
  Max Dauchet: Simulation of Turing Machines by a Regular Rewrite Rule. 409-420