3. STOC 1971

• Donald F. Stanat: Formal Languages and Power Series. 1-11 BibTeX
• Eric G. Wagner: An Algebraic Theory of Recursive Definitions and Recursive Languages. 12-23 BibTeX
• Robert L. Constable: Loop Schemata. 24-39 BibTeX
• J. Ian Munro: Some Results Concerning Efficient and Optimal Algorithms. 40-44 BibTeX
• Charles M. Fiduccia: Fast Matrix Multiplication. 45-49 BibTeX
• W. J. Meyers: Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations. 50-62 BibTeX
• H. W. Buttelmann: On Generalized Finite Automata and Unrestricted Generative Grammars. 63-77 BibTeX
• Leon S. Levy, Aravind K. Joshi: Some Results in Tree Automata. 78-85 BibTeX
• Daniel M. Berry: Block Structure: Retention or Deletion? (Extended Abstract). 86-100 BibTeX
• Shi-Kuo Chang: On the Parallel Computation of Local Operations. 101-115 BibTeX
• Luc Boasson: An Iteration Theorem for One-Counter Languages. 116-120 BibTeX
• Seymour Ginsburg, Jonathan Goldstine: Intersection-Closed full AFL and the Recursively Enumerable Languages. 121-131 BibTeX
• Vaclav Rajlich: Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers. 132-137 BibTeX
• Arnold L. Rosenberg: Addressable Data Graphs: Extended Abstract. 138-150 BibTeX
• Stephen A. Cook: The Complexity of Theorem-Proving Procedures. 151-158 BibTeX
• Alfred V. Aho, Jeffrey D. Ullman: The Care and Feeding of LR(k) Grammars. 159-170 BibTeX
• David S. Wise: Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars. 171-184 BibTeX
• Gérrine Terrine: An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars. 185-205 BibTeX
• Robert McNaughton: A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets. 206-218 BibTeX
• Eugene S. Santos: Algebraic Structure Theory of Stochastic Machines. 219-243 BibTeX
• Robert L. Constable, Juris Hartmanis: Complexity of Formal Translations and Speed-Up Results. 244-250 BibTeX
• Michael Machtey: Classification of Computable Functions by Primitive Recursive Classes. 251-257 BibTeX
• Edward L. Robertson: Complexity Classes of Partial Recursive Functions (Preliminary Version). 258-266 BibTeX