External Links

    Journal: J. Comput. Syst. Sci.

    Volume 10, Issue 3

    317 -- 339Catriel Beeri. Two-Way Nested Stack Automata Are Equivalent to Two-Way Stack Automata
    340 -- 350Leslie G. Valiant, Mike Paterson. Deterministic One-Counter Automata
    351 -- 369Jonathan Goldstine. Some Independent Families of One-Letter Languages
    370 -- 383Giorgio Germano, Andrea Maggiolo-Schettini. Proving a Compiler Correct: A Simple Approach
    384 -- 393Jeffrey D. Ullman. NP-Complete Scheduling Problems
    394 -- 427Teresemarie McCloskey. Abstract Families of Length-Preserving Processors

    Volume 10, Issue 2

    165 -- 182Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach. Uniformly Erasable AFL
    183 -- 199Michael Machtey. On the Density of Honest Subrecursive Classes
    200 -- 218Kenneth B. Salomon. The Decidability of a Mapping Problem for Generalized Sequential Machines with Final States
    219 -- 236Masaharu Mizumoto, Jun ichi Toyoda, K. Tanaka. Various Kinds of Automata with Weights
    237 -- 247Sheila A. Greibach. One Counter Languages and the IRS Condition
    253 -- 265Akira Nakamura. On Causal omega^2-Systems
    266 -- 307Suad Alagic. Natural State Transformations
    308 -- 315Leslie G. Valiant. General Context-Free Recognition in Less than Cubic Time

    Volume 10, Issue 1

    1 -- 43Joseph A. Goguen. Discrete-Time Machines in Closed Monoidal Categories. I
    44 -- 61Victor Harnik. Effective Proper Procedures and Universal Classes of Program Schemata
    62 -- 76Ivan Hal Sudborough. On Tape-Bounded Complexity Classes and Multihead Finite Automata
    77 -- 82Serafino Amoroso, Gerald Cooper, Yale N. Patt. Some Clarifications of the Concept of a Garden-of-Eden Configuration
    83 -- 87James C. Owings. Splitting a Context-Sensitive Set
    88 -- 109Donald I. Kiel. Two-way A-Transducers and AFL
    110 -- 135Edward A. Ashcroft. Proving Assertions about Parallel Programs
    136 -- 163Aravind K. Joshi, Leon S. Levy, Masako Takahashi. Tree Adjunct Grammars
    runs on