JCSS, Volume 13

Volume 13, Number 1, August 1976

James L. Peterson: Computation Sequence Sets. 1-24
Stephen A. Cook, Ravi Sethi: Storage Requirements for Deterministic Polynomial Time Recognizable Languages. 25-37
Kenichi Taniguchi, Tadao Kasami: A Result on the Equivalence Problem for Deterministic Pushdown Automata. 38-50
Patrick C. Fischer, Edward L. Robertson, Lawrence V. Saxton: On the Sequential Nature of Functions. 51-68
David P. Dobkin: A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems. 69-73
Yoshifumi Masunaga, Shoichi Noguchi, Juro Oizumi: A Characterization of Automata and a Direct Product Decomposition. 74-89
Grzegorz Rozenberg, Arto Salomaa: Context-Free Grammars with Graph-Controlled Tables. 90-99
Nancy A. Lynch: Complexity-Class-Encoding Sets. 100-118

Robert M. Baer, Jan van Leeuwen: The Halting Problem for Linear Turing Assemblers. 119-135
Serafino Amoroso, Irving J. Epstein: Indecomposable Parallel Maps in Tessellation Structures. 136-142
Yukio Shibata: On the Structure of Abelian Automata. 143-152
Oscar H. Ibarra, Chul E. Kim: A Useful Device for Showing the Solvability of Some Decision Problems. 153-160
Akihiro Nozaki: Hazard Analysis of Asynchronous Circuits in Muller-Bartky's Sense. 161-171
Richard Laing: Automaton Introspection. 172-183
Arnold Schönhage, Mike Paterson, Nicholas Pippenger: Finding the Median. 184-199
Stephen L. Bloom: Varieties of Ordered Algebras. 200-212
Steve F. McCormick: Some Convergence Results on the Method of Gradients for Ax = lambda Bx. 213-222
André Arnold, Max Dauchet: Un Théorème de Duplication pour les Forêts Algébriques. 223-244

C. Raymond Perrault: Intercalation Lemmas for Tree Transducer Languages. 246-277
Leslie G. Valiant: Graph-Theoretic Properties in computational Complexity. 278-285
Alfred V. Aho, Jeffrey D. Ullman: Node Listings for Reducible Flow Graphs. 286-299
Gary L. Miller: Riemann's Hypothesis and Tests for Primality. 300-317
Harry B. Hunt III, Thomas G. Szymanski: Complexity Metatheorems for Context-Free Grammar Problems. 318-334
Kellogg S. Booth, George S. Lueker: Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. 335-379