Acta Informatica, Volume 23

Volume 23, Number 1, 1986

Edsger W. Dijkstra, A. J. M. van Gasteren: A Simple Fixpoint Argument Without the Restriction to Continuity. 1-7
Ernst-Rüdiger Olderog, C. A. R. Hoare: Specification-Oriented Semantics for Communicating Processes. 9-66
Luc Duponcheel, M. Duponcheel: Acceptable Functional Programming Systems. 67-98
Friedrich Otto: On Deciding Whether a Monoid is a Free Monoid or is a Group. 99-110
Hosam M. Mahmoud: On the Average Internal Path Length of m -ary Search Trees. 111-117

S. A. Bengelloun: An Incremental Primal Sieve. 119-125
Reinhold Heckmann: An Efficient ELL(1)-Parser Generator. 127-148
Ikuo Nakata, Masataka Sassa: Generation of Efficient LALR Parsers for Regular Right Part Grammars. 149-162
Michael Becker, Kurt Mehlhorn: Algorithms for Routing in Planar Graphs. 163-176
Catherine Rosenberg: Files d'attente exponentielles ayant des parametres non-stationnaires dans le temps. 177-192
Neelam Soundararajan: Total Correctness of CSP Programs. 193-215
Mike Paterson, Ingo Wegener: Nearly Optimal Hierarchies for Network and Formula Size. 217-221
Ying-Fung Wu, Peter Widmayer, C. K. Wong: A Faster Approximation Algorithm for the Steiner Problem in Graphs. 223-229

Johann A. Makowsky, Moshe Y. Vardi: On the Expressive Power of Data Dependencies. 231-244
Walter Bucher: A Regularity Test for Dual Bordered OS Systems. 245-253
Maria Calzarossa, M. Italiani, Giuseppe Serazzi: A Workload Model Representative of Static and Dynamic Characteristics. 255-266
Markku Tamminen, W. K. Luk, Paolo Sipala, Lin S. Woo, C. K. Wong: Constructing Maximal Slicings from Geometry. 267-288
Grzegorz Rozenberg, Emo Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. 289-309
Mirko Krivánek, Jaroslav Morávek: NP -Hard Problems in Hierarchical-Tree Clustering. 311-323
Klaus W. Wagner: The Complexity of Combinatorial Problems with Succinct Input Representation. 325-356

A. Bijlsma, J. G. Wiltink, P. A. Matthews: Equivalence of the Gries and Martin Proof Rules for Procedure Calls. 357-360
Piotr Wyrostek: Precedence Technique is not Worse than SLR(1). 361-392
Rodney Farrow, Daniel M. Yellin: A Comparison of Storage Optimizations in Automatically-Generated Attribute Evaluators. 393-427
Maciej Koutny: The Merlin-Randell Problem of Train Journeys. 429-463
Victor F. Nicola: A Single Server Queue with Mixed Types of Interruptions. 465-486

Eric C. R. Hehner, Lorene E. Gupta, Andrew J. Malton: Predicative Methodology. 487-505
Susanne Graf, Joseph Sifakis: A Logic for the Specification and Proof of Regular Controllable Processes of CCS. 507-527
C. C. Lee, D. T. Lee, C. K. Wong: Generating Binary Trees of Bounded Height. 529-544
Demetres D. Kouvatsos: Maximum Entropy and the G/G/1/N Queue. 545-565
Johannes Reichardt: Deterministic Grammars and Grammar Morphisms. 567-583
Yael Maon: On the Equivalence of Some Transductions Involving Letter to Letter Morphisms on Regular Languages. 585-596
Karel Culik II, Juhani Karhumäki: Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence. 597-605

Valdis Berzins: On Merging Software Extensions. 607-619
Robert Geist, Mark Smotherman, Kishor S. Trivedi, Joanne Bechta Dugan: The Reliability of Life-Critical Computer Systems. 621-642
Erol Gelenbe, David Finkel, Satish K. Tripathi: Availability of a Distributed Computer System with Failures. 643-655
J. Cantor, Anthony Ephremides, D. Horton: Information Theoretic Analysis for a General Queueing System at Equilibrium with Application to Queues in Tandem. 657-678
José L. Balcázar, Ronald V. Book: Sets with Small Generalized Kolmogorov Complexity. 679-688
Siegfried Bublitz: Decomposition of Graphs and Monotone Formula Size of Homogeneous Functions. 689-696
Costas S. Iliopoulos: Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem. 697-705