Theoretical Computer Science, Volume 66
Volume 66, Number 1, 1989
Thomas Lehmkuhl, Thomas Lickteig: On the Order of Approximation in Approximative Triadic Decompositions of Tensors. 1-14- Paul E. S. Dunne: On Monotone Simulations of Nonmonotone Networks. 15-25
- Adolfo Piperno: Abstraction Problems in Combinatory Logic a Compositive Approach. 27-43
- Jarkko Kari: Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms. 45-53
- Zhang Luo Xin: A Efficient Algorithm to Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group. 55-63
- Rieks op den Akker: On LC(0) Grammars and Languages. 65-85
- Alasdair Urquhart: The Complexity of Gentzen Systems for Propositional Logic. 87-97
- Richard Statman: On Sets of Solutions to Combinator Equations. 99-104
- Andrzej Pelc: Weakly Adaptive Comparison Searching. 105-111
- Daniele Mundici: Functions Computed by Monotone Boolean Formulas with no Repeated Variables. 113-114
Volume 66, Number 2, 1989
- Volker Diekert: On the Knuth-Bendix Completion for Concurrent Processes. 117-136
- Martin Dietzfelbinger: Lower Bounds for Sorting of Sums. 137-155
- Herbert Edelsbrunner, Günter Rote, Emo Welzl: Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. 157-180
- Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. 181-203
- M. A. Nait Abdallah: A Logico-Algebraic Approach to the Model Theory of Knowledge. 205-232
Volume 66, Number 3, 1989
- Pascal Weil: Inverse Monoids of Dot-Depth Two. 233-245
- Hideki Yamasaki: Language-Theoretical Representations of omega-Languages. 247-254
- Akira Ito, Katsushi Inoue, Itsuo Takanami: Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation. 273-287
- Johann A. Makowsky, Ildikó Sain: Weak Second Order Characterizations of Various Program Verification Systems. 299-321
- Mohamed Mezghiche: On Pseudo-c-beta-Normal Form in Combinatory Logic. 323-331
- Michael L. Tiomkin: Probabilistic Termination Versus Fair Termination. 333-340
- Juha Honkala: A Necessary Condition for the Rationality of the Zeta Function of a Regular Language. 341-347
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team