JCSS, Volume 7

Volume 7, Number 1, February 1973

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

Volume 7, Number 2, April 1973

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

Volume 7, Number 3, June 1973

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

Volume 7, Number 4, August 1973

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

Volume 7, Number 5, October 1973

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

Volume 7, Number 6, December 1973

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