JCSS, Volume 10

Volume 10, Number 1, February 1975

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

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

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