JCSS, Volume 9

Volume 9, Number 1, August 1974

Arthur Gill, Lawrence T. Kou: Multiple-Entry Finite Automata. 1-19 BibTeX
Gerald G. L. Meyer: Algorithm Model for Penalty Functions-Type Iterative Procedures. 20-30 BibTeX
Akira Maruoka, Masayuki Kimura: Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata. 31-47 BibTeX
Eugene M. Norris: Difunctionally Induced State Machines. 48-55 BibTeX
Kai Hwang: Cyclic Decomposition of Finite Stochastic Systems. 56-68 BibTeX
Edward L. Robertson: Complexity Classes of Partial Recursive Functions. 69-87 BibTeX
Seymour Ginsburg, Edwin H. Spanier: On Incomparable Abstract Family of Languages (AFL). 88-108 BibTeX
Lee E. Heindel: Congruence Arithmetic Algorithms for Polynomial Real Zero Determination. 109-128 BibTeX

Yves Rouchaleau, Bostwick F. Wyman: Linear Dynamical Systems over Integral Domains. 129-142 BibTeX
Nancy A. Lynch: Approximations to the Halting Problem. 143-150 BibTeX
Robert P. Daley: The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies. 151-163 BibTeX
S. Rao Kosaraju: 1-Way Stack Automaton with Jumps. 164-176 BibTeX
Takumi Kasai: Translatability of Flowcharts into While Programs. 177-195 BibTeX
Peter Elias: Minimum Times and Memories Needed to Compute the Values of a Function. 196-212 BibTeX
Ronald V. Book: Comparing Complexity Classes. 213-229 BibTeX

S. Rao Kosaraju: Analysis of Structured Programs. 232-255 BibTeX
David S. Johnson: Approximation Algorithms for Combinatorial Problems. 256-278 BibTeX
Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns: Attributed Translations. 279-307 BibTeX
Stephen A. Cook: An Observation on Time-Storage Trade Off. 308-316 BibTeX
Michael J. Fischer, Larry J. Stockmeyer: Fast On-Line Integer Multiplication. 317-331 BibTeX
Jean Vuillemin: Correct and Optimal Implementations of Recursion in a Simple Programming Language. 332-354 BibTeX
Robert Endre Tarjan: Testing Flow Graph Reducibility. 355-365 BibTeX