External Links

    Journal: J. Comput. Syst. Sci.

    Volume 13, Issue 1

    1 -- 24James L. Peterson. Computation Sequence Sets
    25 -- 37Stephen A. Cook, Ravi Sethi. Storage Requirements for Deterministic Polynomial Time Recognizable Languages
    38 -- 50Kenichi Taniguchi, Tadao Kasami. A Result on the Equivalence Problem for Deterministic Pushdown Automata
    51 -- 68Patrick C. Fischer, Edward L. Robertson, Lawrence V. Saxton. On the Sequential Nature of Functions
    69 -- 73David P. Dobkin. A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems
    74 -- 89Yoshifumi Masunaga, Shoichi Noguchi, Juro Oizumi. A Characterization of Automata and a Direct Product Decomposition
    90 -- 99Grzegorz Rozenberg, Arto Salomaa. Context-Free Grammars with Graph-Controlled Tables
    100 -- 118Nancy A. Lynch. Complexity-Class-Encoding Sets
    runs on