Information and Computation, Volume 178

Volume 178, Number 1, 10 October 2002

• Toshihiko Kurata:
  Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees. 1-11
  Electronic Edition (link) BibTeX
• Arnaud Durand:
  Linear Time and the Power of One First-Order Universal Quantifier. 12-22
  Electronic Edition (link) BibTeX
• Furio Honsell, Donald Sannella:
  Prelogical Relations. 23-43
  Electronic Edition (link) BibTeX
• Eike Best, Raymond R. Devillers, Maciej Koutny:
  The Box Algebra = Petri Nets + Process Expressions. 44-100
  Electronic Edition (link) BibTeX
• Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
  Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. 101-131
  Electronic Edition (link) BibTeX
• Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
  Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. 132-148
  Electronic Edition (link) BibTeX
• Peter Møller Neergaard, Morten Heine Sørensen:
  Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions. 149-179
  Electronic Edition (link) BibTeX
• Irek Ulidowski, Iain C. C. Phillips:
  Ordered SOS Process Languages for Branching and Eager Bisimulations. 180-213
  Electronic Edition (link) BibTeX
• Marta Arias, Roni Khardon:
  Learning Closed Horn Expressions. 214-240
  Electronic Edition (link) BibTeX
• Michael V. Vyugin, Vladimir V. V'yugin:
  On Complexity of Easy Predictable Sequences. 241-252
  Electronic Edition (link) BibTeX
• Mikael Goldmann, Alexander Russell:
  The Complexity of Solving Equations over Finite Groups. 253-262
  Electronic Edition (link) BibTeX
• Beate Bollig, Martin Sauerhoff, Ingo Wegener:
  On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. 263-278
  Electronic Edition (link) BibTeX
• Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
  The Small Model Property: How Small Can It Be? 279-293
  Electronic Edition (link) BibTeX
• Salvador Lucas:
  Context-Sensitive Rewriting Strategies. 294-343
  Electronic Edition (link) BibTeX

Volume 178, Number 2, 1 November 2002

• Paliath Narendran, Michaël Rusinowitch:
  Guest Editorial. 345
  Electronic Edition (link) BibTeX
• Franz Baader, Cesare Tinelli:
  Deciding the Word Problem in the Union of Equational Theories. 346-390
  Electronic Edition (link) BibTeX
• Bruno Courcelle:
  A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. 391-411
  Electronic Edition (link) BibTeX
• Jerzy Marcinkowski:
  The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. 412-421
  Electronic Edition (link) BibTeX
• Robert Nieuwenhuis, José Miguel Rivero:
  Practical Algorithms for Deciding Path Ordering Constraint Satisfaction. 422-440
  Electronic Edition (link) BibTeX
• Philippe de Groote:
  On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions. 441-464
  Electronic Edition (link) BibTeX
• Dieter Hofbauer, Maria Huber:
  Test Sets for the Universal and Existential Closure of Regular Tree Languages. 465-498
  Electronic Edition (link) BibTeX
• Takashi Nagaya, Yoshihito Toyama:
  Decidability for Left-Linear Growing Term Rewriting Systems. 499-514
  Electronic Edition (link) BibTeX
• Albert Rubio:
  A Fully Syntactic AC-RPO. 515-533
  Electronic Edition (link) BibTeX
• Hélène Touzet:
  A Characterisation of Multiply Recursive Functions with Higman's Lemma. 534-544
  Electronic Edition (link) BibTeX