JCSS, Volume 11

Volume 11, Number 1, August 1975

Branislav Rovan: Proving Containment of Bounded AFL. 1-55
Oscar H. Ibarra, Sartaj Sahni: Hierarchies of Turing Machines with Restricted Tape Alphabet Size. 56-67
Neil D. Jones: Space-Bounded Reducibility among Combinatorial Problems. 68-85
Armin B. Cremers, Seymour Ginsburg: Context-Free Grammar Forms. 86-117
A. R. Freedman, Richard E. Ladner: Space Bounds for Processing Contentless Inputs. 118-128
Grzegorz Rozenberg, K. P. Lee: Some Properties of the Class of L Languages with Interactions. 129-147

Hidenosuke Nishio, Youichi Kobuchi: Fault Tolerant Cellular Spaces. 150-170
Masateru Harao, Shoichi Noguchi: Fault Tolerant Cellular Automata. 171-185
Vaclav Rajlich: Dynamics of Discrete Systems and Pattern Reproductions. 186-202
Jan van Leeuwen: The Tape-Complexity of Context-Independent Developmental Languages. 203-211
Hartmut Ehrig, Karl Wilhelm Tischer: Graph Grammars and Applications to Specialization and Evolution in Biology. 212-236
W. O. Höllerer, Roland Vollmar: On "Forgetful" Cellular Automata. 237-251
Adrian Walker: Formal Grammars and the Regeneration Capability of Biological Systems. 252-261
Ann Reedy, Walter J. Savitch: Ambiguity in the Developmental Systems of Lindenmayer. 262-283

Robert M. Baer: Computation by Assembly. 285-294
Michael J. Best, Klaus Ritter: An Accelerated Conjugate Direction Method to Solve Linearly Constrained Minimization Problems. 295-322
J. W. de Bakker, Lambert G. L. T. Meertens: On the Completeness of the Inductive Assertion Method. 323-357
Barry K. Rosen: Program Equivalence and Context-Free Grammars. 358-374
Eduardo D. Sontag: On Some Questions of Rationality and Decidability. 375-381
Salvatore Di Gregorio, G. Trautteur: On Reversibility in Cellular Automata. 382-391
Andrzej Ehrenfeucht: Practical Decidability. 392-396
Yoshihide Igarashi, Namio Honda: Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. 397 , ->JCSS 7(2): 199-217 (1973)