Abstract is missing.
- Program Equivalence and Context-Free GrammarsBarry K. Rosen. 7-18
- Effective Computability in Algebraic Structures (A Schematology Approach)Denis J. Kfoury. 19-26
- Representing Program Schemes in LogicJohn C. Cherniavsky, Robert L. Constable. 27-39
- Some Results in Computational TopologyGeorge Tourlakis, John Mylopoulos. 40-51
- On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program SchemesJoseph A. Goguen. 52-60
- Honest Bounds for Complexity Classes of Recursive FunctionsAlbert R. Meyer, Robert Moll. 61-66
- Renamings in Program Schemas (Extended Abstract)Luigi Logrippo. 67-70
- Consistency of Synchronization Nets using P and V OperationsJohn L. Bruno, Edward G. Coffman Jr., W. H. Hosken. 71-77
- On the Decomposition of Asynchronous SystemsRobert M. Keller. 78-89
- Fast Modular Transforms via DivisionR. Moenck, Allan Borodin. 90-96
- The Efficient Calculation of Powers of PolynomialsEllis Horowitz. 97-104
- On the Number of Multiplications for the Evaluation of a Polynomial and All Its DerivativesMary Shaw, J. F. Traub. 105-107
- On the Relation of Graph Grammars and Graph AutomataJohn Mylopoulos. 108-120
- The Emptiness Problem for Automata on Infinite TreesR. Hossley, Charles Rackoff. 121-124
- The Equivalence Problem for Regular Expressions with Squaring Requires Exponential SpaceAlbert R. Meyer, Larry J. Stockmeyer. 125-129
- Some Related Problems from Network Flows, Game Theory and Integer ProgrammingSartaj Sahni. 130-138
- Some Results on the Effect of Arithmetics on Comparison ProblemsNathan Friedman. 139-143
- Fast Allocation AlgorithmsDavid S. Johnson. 144-154
- Optimal Scheduling on Multi-Processor Computing SystemsC. L. Liu. 155-160
- A Fast Algorithm for the Elimination of Common SubexpressionsJeffrey D. Ullman. 161-176
- Universal Test Sets for Logic NetworksSheldon B. Akers Jr.. 177-184
- Multiple Faults in Reed-Muller Canonic NetworksKewal K. Saluja, Sudhakar M. Reddy. 185-191
- Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential CircuitsC.-C. Huang, Richard Y. Kain, Larry L. Kinney. 192-199
- On Sets of Numbers Recognized by Push-Down AutomataJean Berstel. 200-206
- Reversal-Bounded Multi-Pushdown Machines: Extended AbstractBrenda S. Baker, Ronald V. Book. 207-211
- On the Equivalence of Asynchronous Control StructuresJ. Robert Jump, P. S. Thiagarajan. 212-223
- The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular SetsT. S. E. Maibaum. 224-230