External Links

    Journal: J. Comput. Syst. Sci.

    Volume 7, Issue 6

    543 -- 578Joseph D. Rutledge. Program Schemata as Automata I
    579 -- 582Robert D. Rosebrugh, Derick Wood. A Characterization Theorem for n-Parallel Right Linear Languages
    583 -- 596Luc Boasson. Two Iteration Theorems for Some Families of Languages
    597 -- 614D. Nudds. Conversion of Programs Between Computers: Interpreters, Simulators and Compilers
    615 -- 621Akihiro Nozaki. Two Entropies of a Generalized Sorting Problem

    Volume 7, Issue 5

    463 -- 468Meera Blattner. The Unsolvability of the Equality Problem for Sentential Forms of Context-Free Grammars
    469 -- 480Ellis Horowitz. The Efficient Calculation of Powers of Polynomials
    481 -- 496Takeo Yaku. The Constructibility of a Configuration in a Cellular automaton
    497 -- 505Charles E. Hughes. Many-one Degrees Associated with Semi-Thue Systems
    506 -- 521Alan G. Konheim, Bernd Meister. Distributions of Queue Lengths and Waiting Times in a Loop with Two-Way Traffic
    522 -- 542Svetlana P. Kartashev. State Assignment for Realizing Modular Input-Free Sequential Logical Networks Without Invertors

    Volume 7, Issue 4

    334 -- 342H. T. Kung. A Bound on the Multiplicative Efficiency of Iteration
    343 -- 353Stephen A. Cook. A Hierarchy for Nondeterministic Time Complexity
    354 -- 375Stephen A. Cook, Robert A. Reckhow. Time Bounded Random Access Machines
    376 -- 388Claus-Peter Schnorr. Process Complexity and Effective Random Tests
    389 -- 403Walter J. Savitch. Maze Recognizing Automata and Nondeterministic Tape Complexity
    404 -- 447S. A. Walker, H. Raymond Strong. Characterizations of Flowchartable Recursions
    448 -- 461Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan. Time Bounds for Selection

    Volume 7, Issue 3

    237 -- 277Michael A. Harrison, Ivan M. Havel. Strict Deterministic Grammars
    278 -- 287Michael A. Arbib. Coproducts and Decomposable Machines
    288 -- 299Zvi Kohavi, Joseph Winograd. Establishing Certain Bounds Concerning Finite Automata
    300 -- 305Yoshifumi Masunaga, Shoichi Noguchi, Juro Oizumi. A Structure Theory of Automata Characterized by Groups
    306 -- 322To-Yat Cheung. Approximate Solutions and Error Bounds for Quasilinear Elliptic Boundary Value Problems
    323 -- 331John E. Hopcroft, Robert Endre Tarjan. A V log V Algorithm for Isomorphism of Triconnected Planar Graphs

    Volume 7, Issue 2

    119 -- 160Stephen J. Garland, David C. Luckham. Program Schemes, Recursion Schemes, and Formal Languages
    161 -- 167Bernard P. Zeigler. Every Discrete Input Machine is Linearly Simulatable
    168 -- 188Juris Hartmanis, H. Walter. Group Theoretic Characterization of Linear Permutation Automata
    189 -- 198J. Ian Munro, Mike Paterson. Optimal Algorithms for Parallel Polynomial Evaluation
    199 -- 217Yoshihide Igarashi, Namio Honda. On the Extension of Gladkij s Theorem and the Hierarchies of Languages
    218 -- 236Malcolm Bird. The Equivalence Problem for Deterministic Two-Tape Automata

    Volume 7, Issue 1

    1 -- 27Seymour Ginsburg, Sheila A. Greibach. On AFL Generators for Finitely Encoded AFA
    28 -- 36Oscar H. Ibarra. On Two-way Multihead Automata
    37 -- 65Norihiro Abe, Masaharu Mizumoto, Jun ichi Toyoda, Kohkichi Tanaka. Web Grammars and Several Graphs
    66 -- 96Karel Culik II, Rina S. Cohen. LR-Regular Grammars - an Extension of LR(k) Grammars
    97 -- 118Horacio Feliciangeli, Gabor T. Herman. Algorithms for Producing Grammars from Sample Derivations: A Common Problem of Formal Language Theory and Developmental Biology
    runs on