External Links

    Journal: Int. J. Found. Comput. Sci.

    Volume 2, Issue 4

    297 -- 399Narciso Martí-Oliet, José Meseguer. From Petri Nets to Linear Logic through Categories: A Survey
    401 -- 417Katsushi Inoue, Akira Ito, Itsuo Takanami. Alternating Turing Machines with Modified Accepting Structure
    419 -- 424Giovanni Panti. Solution of a Number Theoretic Problem Involving Knowledge

    Volume 2, Issue 3

    183 -- 206Dung T. Huynh. Efficient Detectors and Constructors for Single Languages
    207 -- 220Zhi-Zhong Chen, Seinosuke Toda. On the Complexity of Computing Optimal Solutions
    221 -- 236Angelo Monti, Domenico Parente. Systolic Tree with Base Automata
    237 -- 255Lane A. Hemachandra, Sanjay Jain. On the Limitations of Locally Robust Positive Reductions
    257 -- 265Yves Métivier, Brigitte Rozoy. On the Star Operation in Free Partially Commutative Monoids
    267 -- 296J. V. Tucker, Jeffery I. Zucker. Projections of Semicomputable Relations on Abstract Data Tzpes

    Volume 2, Issue 2

    83 -- 99Vikraman Arvind, Somenath Biswas. Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties
    101 -- 131Thanh Tung Nguyen. A Relational Model of Demonic Nondeterministic Programs
    133 -- 147Hans Leo Bodlaender. On the Complexity of Some Coloring Games
    149 -- 162Sachio Hirokawa. Prinipal Type Assignment to Lambda Terms
    163 -- 182Tao Jiang, Edward McDowell, Bala Ravikumar. The Structure and Complexity of Minimal NFA s over a Unary Alphabet

    Volume 2, Issue 1

    1 -- 21Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin. Faithful Ideal Models for Recursive Polymorphic Types
    23 -- 41Thomas Wilmes. Functional Production Systems Viewed as Grammars
    43 -- 65Jan A. Bergstra, Sjouke Mauw, Freek Wiedijk. Uniform Algebraic Specifications of Finite Sets with Equality
    67 -- 76Jin-yi Cai, Merrick L. Furst. PSPACE Survives Constant-Width Bottlenecks
    77 -- 82Viktória Zankó. #P-Completeness via Many-One Reductions
    runs on