Information and Computation, Volume 169

Volume 169, Number 1, August 2001

• Adel Bouhoula, Jean-Pierre Jouannaud: Automata-Driven Automated Induction. 1-22
• Marco Comini, Giorgio Levi, Maria Chiara Meo: A Theory of Observables for Logic Programs. 23-80
• Kaile Su: More on Representation Theory for Default Logic. 81-93
• Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Incremental Convex Planarity Testing. 94-126

Volume 169, Number 2, September 2001

• Richard Chang: Bounded Queries, Approximations, and the Boolean Hierarchy. 129-159
• Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson: Quorum Systems Constructed from Combinatorial Designs. 160-173
• Bruce E. Litow: Computing a Context-Free Grammar-Generating Series. 174-185
• Symeon Bozapalidis: Context-Free Series on Trees. 186-229
• Pekka Kilpeläinen, Derick Wood: SGML and XML Document Grammars and Exceptions. 230-251
• Vladimir V. V'yugin: Most Sequences Are Stochastic. 252-263
• Frank Drewes: The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. 264-283
• Juraj Hromkovic, Georg Schnitger: On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. 284-296