## Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp

*Proceedings of the Second Annual ACM Symposium on Theory of Computing*

STOC, 1970.

@proceedings{STOC-1970, address = "Northampton, Massachusetts, USA", editor = "Patrick C. Fischer and Robert Fabian and Jeffrey D. Ullman and Richard M. Karp", publisher = "{ACM}", title = "{Proceedings of the Second Annual ACM Symposium on Theory of Computing}", year = 1970, }

### Contents (27 items)

- STOC-1970-Constable #on the #recursion #source code
- On the Size of Programs in Subrecursive Formalisms (RLC), pp. 1–9.
- STOC-1970-Cudia #decidability #problem
- The Degree Hierarchy of Undecidable Problems of Formal Grammars (DFC), pp. 10–21.
- STOC-1970-Lewis #complexity
- Unsolvability Considerations in Computational Complexity (FDL), pp. 22–30.
- STOC-1970-LandweberR #complexity #recursion
- Recursive Properties of Abstract Complexity Classes (LHL, ELR), pp. 31–36.
- STOC-1970-BassY #complexity #set
- Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (LJB, PRY), pp. 37–40.
- STOC-1970-Ausiello #bound #on the
- On Bounds on the Number of Steps to Compute Functions (GA), pp. 41–47.
- STOC-1970-Rosenberg #graph
- Data Graphs and Addressing Schemes: Extended Abstract (ALR), pp. 48–61.
- STOC-1970-Burkhard #complexity #problem #realtime
- Complexity Problems in Real Time Computation (WAB), pp. 62–69.
- STOC-1970-Cook #recognition
- Path Systems and Language Recognition (SAC), pp. 70–72.
- STOC-1970-Morris #precedence
- A Result on the Relationship between Simple Precedence Languages and Reducing Transition Languages (JBM), pp. 73–80.
- STOC-1970-Lindstrom #design #incremental #parsing
- The Design of Parsers for Incremental Language Processors (GL), pp. 81–91.
- STOC-1970-BookGW #bound
- Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract (RVB, SAG, BW), pp. 92–99.
- STOC-1970-Lewis70a #product line
- Closure of Families of Languages under Substitution Operators (DJL), pp. 100–108.
- STOC-1970-Rounds #proving #theorem
- Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages (WCR), pp. 109–116.
- STOC-1970-Rosen #theorem
- Tree-Manipulating Systems and Church-Rosser Theorems (BKR), pp. 117–127.
- STOC-1970-MartinV #on the #transducer
- On Syntax-Directed Transduction and Tree Transducers (DFM, SAV), pp. 129–135.
- STOC-1970-AhoU
- Transformations on Straight Line Programs-Preliminary Version (AVA, JDU), pp. 136–148.
- STOC-1970-McGowan #correctness
- The Correctness of a Modified SECD Machine (CLM), pp. 149–157.
- STOC-1970-Manna #higher-order
- Second-Order Mathematical Theory of Computation (ZM), pp. 158–168.
- STOC-1970-KingF #integer #proving #theorem proving
- An Interpretation Oriented Theorem Prover over Integers (JCK, RWF), pp. 169–179.
- STOC-1970-Reiter #proving #theorem proving
- The Predicate Elimination Strategy in Theorem Proving (RR), pp. 180–183.
- STOC-1970-Strong #equation #recursion
- Translating Recursion Equations into Flow Charts (HRSJ), pp. 184–197.
- STOC-1970-Ellis #automaton #probability
- Probabilistic Tree Automata (CAE), pp. 198–205.
- STOC-1970-Chang #2d #analysis #using
- The Analysis of Two-Dimensional Patterns using Picture Processing Grammars (SKC), pp. 206–216.
- STOC-1970-Perrot #automaton #finite #monad #on the
- On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.
- STOC-1970-Nivat #on the #product line
- On Some Families of Languages Related to the Dyck Language (MN), pp. 221–225.
- STOC-1970-Ullian #product line #theorem
- Three Theorems on Abstract Families of Languages (JSU), pp. 226–230.

5 ×#on the

4 ×#complexity

3 ×#product line

3 ×#proving

3 ×#recursion

3 ×#theorem

2 ×#automaton

2 ×#bound

2 ×#problem

2 ×#theorem proving

4 ×#complexity

3 ×#product line

3 ×#proving

3 ×#recursion

3 ×#theorem

2 ×#automaton

2 ×#bound

2 ×#problem

2 ×#theorem proving