1. STOC 1969

• P. Stanley Peters Jr., Robert W. Ritchie: Context-Sensitive Immediate Constituent Analysis-Context-Free Languages Revisited. 1-8
• Gene F. Rose: Abstract Families of Processors. 9-14
• Ronald V. Book, Sheila A. Greibach: Quasi-Realtime Languages-Extended Abstract. 15-18
• Joseph S. Ullian: The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages. 19-20
• W. J. Chandler: Abstract Families of Deterministic Languages. 21-30
• William F. Ogden: Intercalation Theorems for Stack Languages. 31-42
• Manuel Blum: On Effective Procedures for Speeding Up Algorithms. 43-53
• Sanat K. Basu: On Classes of Computable Functions. 55-59
• Donald W. Loveland: On Minimal-Program Complexity Measures. 61-65
• Allan Borodin: Complexity Classes of Recursive Functions and the Existence of Complexity Gaps. 67-78
• Edward M. McCreight, Albert R. Meyer: Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report. 79-88
• Paul R. Young: Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version). 89-92
• Alfred V. Aho, Jeffrey D. Ullman: Translations on a Context Free Grammar. 93-112
• Peter Johansen: Free Groups and Regular Expressions. 113-128
• James W. Thatcher: Transformations and Translations from the Point of View of Generalized Finite Automata Theory. 129-142
• William C. Rounds: Context-Free Grammars on Trees. 143-148
• Gabor T. Herman, Stephen D. Isard: Computability over Arbitrary Fields. 149-153
• C. D. Shepard: Languages in General Algebras. 155-163
• Daniel J. Rosenkrantz, Richard Edwin Stearns: Properties of Deterministic Top Down Grammars. 165-180
• Michael J. Fischer: Some Properties of Precedence Languages. 181-190
• A. J. Korenjak: Efficient LR(1) Processor Construction. 191-200
• Zohar Manna, Amir Pnueli: Formalization of Properties of Recursively Defined Functions. 201-210
• H. Paul Zeiger: Formal Models for Some Features of Programming Languages. 211-215
• Stephen A. Cook: Variations on Pushdown Machines (Detailed Abstract). 229-231
• Stephen N. Cole: Pushdown Store Machines and Real-Time Computation. 233-245
• Walter J. Savitch: Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract). 247-248
• Louis Hodes: The Logical Complexity of Geometric Properties in the Plane. 249-254
• Algirdas Avizienis: On the Problem of Computational Time and Complexity of Arithmetic Functions. 255-258
• Serafino Amoroso, Edward Lieblein, Hisao Yamada: A Unifying Framework for the Theory of Iterative Arrays of Machines. 259-269
• Philip M. Spira: On the Computation Time of Certain Classes of Boolean Functions. 271-272