| 1969 | A Unifying Framework for the Theory of Iterative Arrays of Machines Serafino Amoroso, Edward Lieblein, Hisao Yamada |
| 1969 | Abstract Families of Deterministic Languages W. J. Chandler |
| 1969 | Abstract Families of Processors Gene F. Rose |
| 1969 | Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report Edward M. McCreight, Albert R. Meyer |
| 1969 | Complexity Classes of Recursive Functions and the Existence of Complexity Gaps Allan Borodin |
| 1969 | Computability over Arbitrary Fields Gabor T. Herman, Stephen D. Isard |
| 1969 | Context-Free Grammars on Trees William C. Rounds |
| 1969 | Context-Sensitive Immediate Constituent Analysis-Context-Free Languages Revisited P. Stanley Peters Jr., Robert W. Ritchie |
| 1969 | Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) Walter J. Savitch |
| 1969 | Efficient LR(1) Processor Construction A. J. Korenjak |
| 1969 | Formal Models for Some Features of Programming Languages H. Paul Zeiger |
| 1969 | Formalization of Properties of Recursively Defined Functions Zohar Manna, Amir Pnueli |
| 1969 | Free Groups and Regular Expressions Peter Johansen |
| 1969 | Intercalation Theorems for Stack Languages William F. Ogden |
| 1969 | Languages in General Algebras C. D. Shepard |
| 1969 | On Classes of Computable Functions Sanat K. Basu |
| 1969 | On Effective Procedures for Speeding Up Algorithms Manuel Blum |
| 1969 | On Minimal-Program Complexity Measures Donald W. Loveland |
| 1969 | On the Computation Time of Certain Classes of Boolean Functions Philip M. Spira |
| 1969 | On the Problem of Computational Time and Complexity of Arithmetic Functions Algirdas Avizienis |
| 1969 | Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5-7, 1969, Marina del Rey, CA, USA Patrick C. Fischer, Seymour Ginsburg, Michael A. Harrison |
| 1969 | Properties of Deterministic Top Down Grammars Daniel J. Rosenkrantz, Richard Edwin Stearns |
| 1969 | Pushdown Store Machines and Real-Time Computation Stephen N. Cole |
| 1969 | Quasi-Realtime Languages-Extended Abstract Ronald V. Book, Sheila A. Greibach |
| 1969 | Some Properties of Precedence Languages Michael J. Fischer |
| 1969 | Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version) Paul R. Young |
| 1969 | The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages Joseph S. Ullian |
| 1969 | The Logical Complexity of Geometric Properties in the Plane Louis Hodes |
| 1969 | Towards a Theory of Semantics and Compilers for Programming Languages Edward K. Blum |
| 1969 | Transformations and Translations from the Point of View of Generalized Finite Automata Theory James W. Thatcher |
| 1969 | Translations on a Context Free Grammar Alfred V. Aho, Jeffrey D. Ullman |
| 1969 | Variations on Pushdown Machines (Detailed Abstract) Stephen A. Cook |