3. STOC 1971: Shaker Heights, Ohio, USA

Michael A. Harrison, Ranan B. Banerji, Jeffrey D. Ullman (Eds.): Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA. ACM 1971

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

Last update Sat May 25 19:09:14 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page