Theoretical Computer Science, Volume 129

Volume 129, Number 1, 20 June 1994

Uri Abraham, Menachem Magidor: On the Mutual-Exclusion Problem - A Quest for Minimal Solutions. 1-38 BibTeX
Hirofumi Yokouchi: F-Semantics for Type Assignment Systems. 39-77 BibTeX
Jean-Louis Krivine: A General Storage Theorem for Integers in Call-by-Name lambda-Calculus. 79-94 BibTeX
Cheng-Chia Chen, I-Peng Lin: The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. 95-121 BibTeX
Jiawang Wei: Correctness of Fixpoint Transformations. 123-142 BibTeX
John C. Shepherdson: The Role of Standardising Apart in Logic Programming. 143-142 BibTeX
Zoran Ognjanovic: A Tableau-Like Proof Procedure for Normal Modal Logics. 167-186 BibTeX
Richard Banach: Regular Relations and Bicartesian Squares. 187-192 BibTeX
Wenhui Zhang: Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut Formulas. 193-206 BibTeX

A. H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg: Clans and Regions in 2-Structures. 207-262 BibTeX
Jean-Paul Allouche, Mireille Bousquet-Mélou: Canonical Positions for the Factors in Paperfolding Sequences. 263-278 BibTeX
Bernard Delyon, Oded Maler: On the Effects of Noise and Speed on Computations. 279-291 BibTeX
Joseph JáJá, Kwan Woo Ryu: An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. 293-307 BibTeX
K. Ganesan: One-Way Functions and the Isomorphism Conjecture. 309-321 BibTeX
Craig A. Rich, Giora Slutzki: The Complexity of Optimizing Finite-State Transducers. 323-336 BibTeX
Timo Knuutila, Magnus Steinby: The Inference of Tree Languages from Finite Samples: An Algebraic Approach. 337-367 BibTeX
Sébastien Ferenczi: Tiling and Local Rank Properties of the Morse Sequence. 369-383 BibTeX
Marion Scheepers: Variations on a Game of Gale (II): Markov Strategies. 385-396 BibTeX
Daniel M. Yellin: An Algorithm for Dynamic Subset and Intersection Testing. 397-406 BibTeX
Ömer Egecioglu, Çetin Kaya Koç: Exponentiation Using Canonical Recoding. 407-417 BibTeX
Maurice Margenstern: Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. 419-424 BibTeX