18. FOCS 1977:
Providence,
Rhode Island,
USA
18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977.
IEEE Computer Society 1977
Session I
Session II
- Ronald V. Book:
Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets.
58-61
- Harry R. Lewis:
A New Decidable Problem, with Applications (Extended Abstract).
62-73
- Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications.
74-81
- Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity.
82-89
- Richard Statman:
The Typed lambda-Calculus Is not Elementary Recursive.
90-94
- Leonard Berman:
Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report.
95-99
- Victor L. Bennison, Robert I. Soare:
Recursion Theoretic Characterizations of Complexity Theoretic Properties.
100-106
Session III
Session IV
Session V
Last update Fri May 25 08:14:14 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page