STOC A*

28 papers

YearTitle / Authors
1970A Result on the Relationship between Simple Precedence Languages and Reducing Transition Languages
James B. Morris
1970An Interpretation Oriented Theorem Prover over Integers
James C. King, Robert W. Floyd
1970Closure of Families of Languages under Substitution Operators
David J. Lewis
1970Complexity Problems in Real Time Computation
Walter A. Burkhard
1970Data Graphs and Addressing Schemes: Extended Abstract
Arnold L. Rosenberg
1970Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (Preliminary Report)
Leonard J. Bass, Paul R. Young
1970On Bounds on the Number of Steps to Compute Functions
Giorgio Ausiello
1970On Some Families of Languages Related to the Dyck Language
Maurice Nivat
1970On Syntax-Directed Transduction and Tree Transducers
David F. Martin, Steven A. Vere
1970On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes
Jean-François Perrot
1970On the Size of Programs in Subrecursive Formalisms
Robert L. Constable
1970Path Systems and Language Recognition
Stephen A. Cook
1970Probabilistic Tree Automata
Clarence A. Ellis
1970Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA
Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp
1970Recursive Properties of Abstract Complexity Classes (Preliminary Version)
Lawrence H. Landweber, Edward L. Robertson
1970Second-Order Mathematical Theory of Computation
Zohar Manna
1970Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract
Ronald V. Book, Sheila A. Greibach, Ben Wegbreit
1970The Analysis of Two-Dimensional Patterns using Picture Processing Grammars
Shi-Kuo Chang
1970The Correctness of a Modified SECD Machine
Clement L. McGowan
1970The Degree Hierarchy of Undecidable Problems of Formal Grammars
Dennis F. Cudia
1970The Design of Parsers for Incremental Language Processors
Gary Lindstrom
1970The Predicate Elimination Strategy in Theorem Proving
Raymond Reiter
1970Three Theorems on Abstract Families of Languages
Joseph S. Ullian
1970Transformations on Straight Line Programs-Preliminary Version
Alfred V. Aho, Jeffrey D. Ullman
1970Translating Recursion Equations into Flow Charts
H. R. Strong Jr.
1970Tree-Manipulating Systems and Church-Rosser Theorems
Barry K. Rosen
1970Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages
William C. Rounds
1970Unsolvability Considerations in Computational Complexity
Forbes D. Lewis