


default search action
Theoretical Computer Science, Volume 22
Volume 22, 1983
- J. Roger Hindley:
The Completeness Theorem for Typing lambda-Terms. 1-17 - Masahiko Sato:
Theory of Symbolic Expressions, I. 19-55 - Jan Pittl, Amiram Yehudai:
Constructing a Realtime Deterministic Pushdown Automaton from a Grammar. 57-69 - Péter Gács:
On the Relation between Descriptional Complexity and Algorithmic Probability. 71-93 - Werner Kuich, Friedrich J. Urbanek:
Infinite Linear Systems and one Counter Languages. 95-126 - J. Roger Hindley:
Curry's Type-Rules are Complete with Respect to the F-Semantics too. 127-133 - Gérard Boudol, Laurent Kott:
Recursion Induction Principle Revisited. 135-173 - Minoru Ito, Kenichi Taniguchi, Tadao Kasami:
Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions. 175-194 - Grzegorz W. Wasilkowski:
Any Iteration for Polynomial Equations Using Linear Information has Infinite Complexity. 195-208 - D. T. Lee, C. L. Liu, C. K. Wong:
(g 0, g 1, ... g k)-Trees and Unary OL Systems. 209-217 - Magnus Steinby:
Systolic Trees and Systolic Language Recognition by Tree Automata. 219-232 - G. Lev, Leslie G. Valiant:
Size Bounds for Superconcentrators. 233-251 - Masako Takahashi:
Nest Sets and Relativized Closure Properties. 253-264 - Jan A. Bergstra, John V. Tucker:
Hoare's Logic and Peano's Arithmetic. 265-284 - Abraham Lempel, Gadiel Seroussi, Shmuel Winograd:
On the Complexity of Multiplication in Finite Fields. 285-296 - Alberto Apostolico, Franco P. Preparata:
Optimal Off-Line Detection of Repetitions in a String. 297-315 - Walter Baur, Volker Strassen:
The Complexity of Partial Derivatives. 317-330 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
L Codes and Number Systems. 331-346

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.
