JCSS, Volume 12

Volume 12, Number 1, February 1976

Takeo Yaku: Surjectivity of Nondeterministic Parallel Maps Induced by Nondeterministic Cellular Automata. 1-5 BibTeX
D. Richardson: Continuous Self-Reproduction. 6-12 BibTeX
F. Joanne Helton: The Semigroup of an Algebra Automaton. 13-24 BibTeX
Sam Savage, Peter Weiner, A. Bagchi: Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient. 25-35 BibTeX
Masakazu Nasu, Namio Honda: A Completeness Property of One-Dimensional Tessellation Automata. 36-48 BibTeX
Yoshinori Ezawa, Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka: Interactive Languages. 49-63 BibTeX
Johnson M. Hart: The Derivation Language of a Phrase Structure Grammar. 64-79 BibTeX
Klaus Weihrauch: The Computational Complexity of Program Schemata. 80-107 BibTeX
R. R. Meyer: Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms. 108-121 BibTeX
Forbes D. Lewis: On Computational Reducibility. 122-131 BibTeX

Andrzej Ehrenfeucht, H. Paul Zeiger: Complexity Measures for Regular Expressions. 134-146 BibTeX
Kurt Mehlhorn: Polynomial and Abstract Subrecursive Classes. 147-178 BibTeX
Bruno Courcelle, Jean Vuillemin: Completeness Results for the Equivalence of Recursive Schemas. 179-197 BibTeX
Vaughan R. Pratt, Larry J. Stockmeyer: A Characterization of the Power of Vector Machines. 198-221 BibTeX
Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski: On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. 222-268 BibTeX

Hartmut Ehrig, Hans-Jörg Kreowski: Systematic Approach to Reduction and Minimization in Automata and System Theory. 269-304 BibTeX
Stephen L. Bloom, Calvin C. Elgot: The Existence and Construction of Free Iterative Theories. 305-318 BibTeX
John L. Bruno, Edward G. Coffman Jr., D. B. Johnson: On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server. 319-335 BibTeX
Yuri Breitbart: Some Bounds on the Complexity of Predicate Recognition by Finite Automata. 336-349 BibTeX
Zvi Galil, Janos Simon: A Note on Multiple-Entry Finite Automata. 350-351 BibTeX
Kosaburo Hashiguchi, Namio Honda: Properties of Code Events and Homomorphisms over Regular Events. 352-367 BibTeX
Donald A. Alton: Nonexistence of Program Optimizers in Several Abstract Settings. 368-393 BibTeX
Peter Gordon Anderson: Another Proof of the Theorem on Pattern Reproduction in Tessellation Structures. 394-398 BibTeX
Jonathan Goldstine: Bounded AFLs. 399-419 BibTeX