External Links

    Journal: Theoretical Computer Science

    Volume 82, Issue 2

    177 -- 214Michel Bauderon. Infinite Hypergraphs I. Basic Properties
    215 -- 252Giorgio Germano, Stefano Mazzanti. Closure Functions and General Iterates as Reflectors
    253 -- 284. The Existence of Refinement Mappings
    285 -- 302Jos C. M. Baeten, Jan A. Bergstra. Recursive Process Definitions with the State Operator
    303 -- 327Axel Lukassen, Gottfried Vossen. A Formal Framework for Independence with Respect to Transactions in the Universal Relation Model
    329 -- 339Wieslaw Szwast. On Horn Spectra
    341 -- 372Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen. A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets
    373 -- 388François Denis, Jean-Paul Delahaye. Is there an Axiomatic Semantics for Standard Pure Prolog
    389 -- 402Pierre-Louis Curien. An Abstract Framework for Environment Machines
    403 -- 408Eric Badouel, Philippe Darondeau. On Guarded Recursion
    409 -- 418R. Hoofman. Weakly Expressive Models for Hoare Logic

    Volume 82, Issue 1

    1 -- 18Klaus Weihrauch, Christoph Kreitz. Type 2 Computational Complexity of Functions on Cantor s Space
    19 -- 33Barbara Lando. Periodicity and Ultimate Periodicity of D0L Systems
    35 -- 49Jean-Jacques Hébrard. An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences
    51 -- 69Ker-I Ko. On Adaptive Versus Nonadaptive Bounded Query Machines
    71 -- 84Filippo Mignosi. On the Number of Factors of Sturmian Words
    85 -- 93Marc Snir. Size-depth Trade-Offs for Monotone Arithmetic Circuits
    95 -- 111Joost Engelfriet, George Leih, Grzegorz Rozenberg. Nonterminal Separation in Graph Grammars
    113 -- 129Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger. The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines
    131 -- 139Kai Salomaa, Sheng Yu. Decidability of Structural Equivalence of E0L Grammars
    141 -- 149J. M. Robson. An O (T log T) Reduction from RAM Computations to Satisfiability
    151 -- 155Cristian Calude, Gabriel Istrate. Determining and Stationary Sets for Some Classes of Partial Recursive Functions
    157 -- 163Vladimir Palko, Ondrej Sýkora, Imrich Vrto. Area Complexity of Merging
    165 -- 176Joop M. I. M. Leo. A General Context-Free Parsing Algorithm Running in Linear Time on Every LR (k) Grammar Without Using Lookahead
    runs on