2. STOC 1970

• Robert L. Constable: On the Size of Programs in Subrecursive Formalisms. 1-9 BibTeX
• Dennis F. Cudia: The Degree Hierarchy of Undecidable Problems of Formal Grammars. 10-21 BibTeX
• Forbes D. Lewis: Unsolvability Considerations in Computational Complexity. 22-30 BibTeX
• Lawrence H. Landweber, Edward L. Robertson: Recursive Properties of Abstract Complexity Classes (Preliminary Version). 31-36 BibTeX
• Leonard J. Bass, Paul R. Young: Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (Preliminary Report). 37-40 BibTeX
• Giorgio Ausiello: On Bounds on the Number of Steps to Compute Functions. 41-47 BibTeX
• Arnold L. Rosenberg: Data Graphs and Addressing Schemes: Extended Abstract. 48-61 BibTeX
• Walter A. Burkhard: Complexity Problems in Real Time Computation. 62-69 BibTeX
• Stephen A. Cook: Path Systems and Language Recognition. 70-72 BibTeX
• James B. Morris: A Result on the Relationship between Simple Precedence Languages and Reducing Transition Languages. 73-80 BibTeX
• Gary Lindstrom: The Design of Parsers for Incremental Language Processors. 81-91 BibTeX
• Ronald V. Book, Sheila A. Greibach, Ben Wegbreit: Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. 92-99 BibTeX
• William C. Rounds: Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages. 109-116 BibTeX
• Barry K. Rosen: Tree-Manipulating Systems and Church-Rosser Theorems. 117-127 BibTeX
• David F. Martin, Steven A. Vere: On Syntax-Directed Transduction and Tree Transducers. 129-135 BibTeX
• Alfred V. Aho, Jeffrey D. Ullman: Transformations on Straight Line Programs-Preliminary Version. 136-148 BibTeX
• Clement L. McGowan: The Correctness of a Modified SECD Machine. 149-157 BibTeX
• Zohar Manna: Second-Order Mathematical Theory of Computation. 158-168 BibTeX
• James C. King, Robert W. Floyd: An Interpretation Oriented Theorem Prover over Integers. 169-179 BibTeX
• Raymond Reiter: The Predicate Elimination Strategy in Theorem Proving. 180-183 BibTeX
• H. R. Strong Jr.: Translating Recursion Equations into Flow Charts. 184-197 BibTeX
• Clarence A. Ellis: Probabilistic Tree Automata. 198-205 BibTeX
• Shi-Kuo Chang: The Analysis of Two-Dimensional Patterns using Picture Processing Grammars. 206-216 BibTeX
• Jean-François Perrot: On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes. 217-220 BibTeX
• Maurice Nivat: On Some Families of Languages Related to the Dyck Language. 221-225 BibTeX
• Joseph S. Ullian: Three Theorems on Abstract Families of Languages. 226-230 BibTeX