default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation 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 - Arnaud Durand:
Linear Time and the Power of One First-Order Universal Quantifier. 12-22 - Furio Honsell, Donald Sannella:
Prelogical Relations. 23-43 - Eike Best, Raymond R. Devillers, Maciej Koutny:
The Box Algebra = Petri Nets + Process Expressions. 44-100 - Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. 101-131 - Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. 132-148 - Peter Møller Neergaard, Morten Heine Sørensen:
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions. 149-179 - Irek Ulidowski
, Iain C. C. Phillips:
Ordered SOS Process Languages for Branching and Eager Bisimulations. 180-213 - Marta Arias, Roni Khardon:
Learning Closed Horn Expressions. 214-240 - Michael V. Vyugin, Vladimir V. V'yugin:
On Complexity of Easy Predictable Sequences. 241-252 - Mikael Goldmann, Alexander Russell:
The Complexity of Solving Equations over Finite Groups. 253-262 - Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. 263-278 - Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
The Small Model Property: How Small Can It Be? 279-293 - Salvador Lucas:
Context-Sensitive Rewriting Strategies. 294-343
Volume 178, Number 2, 1 November 2002
- Paliath Narendran, Michaël Rusinowitch:
Guest Editorial. 345 - Franz Baader, Cesare Tinelli:
Deciding the Word Problem in the Union of Equational Theories. 346-390 - Bruno Courcelle:
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. 391-411 - Jerzy Marcinkowski:
The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. 412-421 - Robert Nieuwenhuis, José Miguel Rivero:
Practical Algorithms for Deciding Path Ordering Constraint Satisfaction. 422-440 - Philippe de Groote:
On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions. 441-464 - Dieter Hofbauer, Maria Huber:
Test Sets for the Universal and Existential Closure of Regular Tree Languages. 465-498 - Takashi Nagaya, Yoshihito Toyama:
Decidability for Left-Linear Growing Term Rewriting Systems. 499-514 - Albert Rubio:
A Fully Syntactic AC-RPO. 515-533 - Hélène Touzet:
A Characterisation of Multiply Recursive Functions with Higman's Lemma. 534-544
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
