Theoretical Computer Science, Volume 57

Volume 57, 1988

• Manfred Broy: Equational Specification of Partial Higher-Order Algebras. 3-45
• Oscar H. Ibarra, Michael A. Palis: Two-Dimensional Iterative Arrays: Characterizations and Applications. 47-86
• Farid M. Ablyv: The Complexity Properties of Probabilistic Automata with Isolated Cut Point. 87-95
• Juraj Hromkovic: The Advantages of a New Approach to Defining the Communication Complexity for VLSI. 91-111
• Stasys Jukna: Entropy of Contact Circuits and Lower Bounds on Their Complexity. 113-129
• Jorma Tarhio, Esko Ukkonen: A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. 131-145
• Werner Kuich: Matrix Systems and Principal Cones of Algebraic Power Series. 147-152
• Wladyslaw Skarbek: Generating Ordered Trees. 153-159
• Arnon Avron: The Semantics and Proof Theory of Linear Logic. 161-184
• Laurent Pierre, Jean-Marc Farinone: Rational Index of Context-Free Languages in exp Theta(p root n) and n^(Theta((ln n)^(1/p))). 185-204
• Yuri Velinov: An Algebraic Structure for Derivations in Rewriting Systems. 205-224
• Oscar H. Ibarra, Tao Jiang: Relating the Power of Cellular Arrays to Their Closure Properties. 225-238
• Gérard Duchamp, Jean-Yves Thibon: Theoremes de Transfert pour les Polynomes Partiellement Commutatifs. 239-249
• John-Jules Ch. Meyer, Erik P. de Vink: Applications of Compactness in the Smyth Powerdomain of Streams. 251-282
• Marie-Pierre Béal: Codes Circulaires, Automates Locaux et Entropie. 283-302
• Kosaburo Hashiguchi: Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages. 303-316
• Andrzej Szalas, Leszek Holenderski: Incompleteness of First-Order Temporal Logic with Until. 317-325
• Jerrold W. Grossman, R. Suzanne Zeitman: An Inherently Iterative Computation of Ackermanns's Function. 327-330