default search action
2nd STOC 1970: Northampton, Massachusetts, USA
- Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp:
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM 1970 - Robert L. Constable:
On the Size of Programs in Subrecursive Formalisms. 1-9 - Dennis F. Cudia:
The Degree Hierarchy of Undecidable Problems of Formal Grammars. 10-21 - Forbes D. Lewis:
Unsolvability Considerations in Computational Complexity. 22-30 - Lawrence H. Landweber, Edward L. Robertson:
Recursive Properties of Abstract Complexity Classes (Preliminary Version). 31-36 - Leonard J. Bass, Paul R. Young:
Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (Preliminary Report). 37-40 - Giorgio Ausiello:
On Bounds on the Number of Steps to Compute Functions. 41-47 - Arnold L. Rosenberg:
Data Graphs and Addressing Schemes: Extended Abstract. 48-61 - Walter A. Burkhard:
Complexity Problems in Real Time Computation. 62-69 - Stephen A. Cook:
Path Systems and Language Recognition. 70-72 - James B. Morris:
A Result on the Relationship between Simple Precedence Languages and Reducing Transition Languages. 73-80 - Gary Lindstrom:
The Design of Parsers for Incremental Language Processors. 81-91 - Ronald V. Book, Sheila A. Greibach, Ben Wegbreit:
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. 92-99 - David J. Lewis:
Closure of Families of Languages under Substitution Operators. 100-108 - William C. Rounds:
Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages. 109-116 - Barry K. Rosen:
Tree-Manipulating Systems and Church-Rosser Theorems. 117-127 - David F. Martin, Steven A. Vere:
On Syntax-Directed Transduction and Tree Transducers. 129-135 - Alfred V. Aho, Jeffrey D. Ullman:
Transformations on Straight Line Programs-Preliminary Version. 136-148 - Clement L. McGowan:
The Correctness of a Modified SECD Machine. 149-157 - Zohar Manna:
Second-Order Mathematical Theory of Computation. 158-168 - James C. King, Robert W. Floyd:
An Interpretation Oriented Theorem Prover over Integers. 169-179 - Raymond Reiter:
The Predicate Elimination Strategy in Theorem Proving. 180-183 - H. R. Strong Jr.:
Translating Recursion Equations into Flow Charts. 184-197 - Clarence A. Ellis:
Probabilistic Tree Automata. 198-205 - Shi-Kuo Chang:
The Analysis of Two-Dimensional Patterns using Picture Processing Grammars. 206-216 - Jean-François Perrot:
On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes. 217-220 - Maurice Nivat:
On Some Families of Languages Related to the Dyck Language. 221-225 - Joseph S. Ullian:
Three Theorems on Abstract Families of Languages. 226-230
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: