Acta Informatica, Volume 31

Volume 31, Number 1, 1994

• Dana S. Scott:
  A. Nico Habermann 1932-1993. 1-3
  
• José Félix Costa, Amílcar Sernadas, Cristina Sernadas:
  Object Inheritance Beyond Subtyping. 5-26
  
• Jianwen Su:
  Dependency Preservation in Semantic Databases. 27-54
  
• Nicoletta De Francesco, Paola Inverardi:
  Proving Finiteness of CCS Processes by Non-Standard Semantics. 55-80
  
• Christel Baier, Mila E. Majster-Cederbaum:
  The Connection between an Event Structure Semantics and an Operational Semantics for TCSP. 81-104
  

Volume 31, Number 2, 1994

• Joakim von Wright:
  The Lattice of Data Refinement. 105-135
  
• Catherine Mongenet, Philippe Clauss, Guy-René Perrin:
  Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays. 137-160
  
• Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
  Context-free Text Grammars. 161-206
  

Volume 31, Number 3, 1994

• Vincenzo Grassi:
  Dependability Evaluation of Hierarchical Systems. 207-233
  
• Symeon Bozapalidis, George Rahonis:
  On two Families of Forests. 235-260
  
• Myung-Joon Lee, Kwang-Moo Choe:
  Boundedly LR( k )-conflictable Grammars. 261-283
  
• Hongzhong Wu:
  On n-Column 0, 1-Matrices with all k-Projections Surjective. 285-299
  

Volume 31, Number 4, 1994

• Jyrki Katajainen, Tomi Pasanen:
  Sorting Multisets Stably in Minimum Space. 301-313
  
• Oscar H. Ibarra, Nicholas Q. Trân:
  On Communication-Bounded Synchronized Alternating Finite Automata. 315-327
  
• Karl Meinke:
  A Recursive Second Order Initial Algebra Specification of Primitive Recursion. 329-340
  
• Joost Engelfriet, Linda Heyker, George Leih:
  Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. 341-378
  
• Volker Diekert, Anca Muscholl:
  Deterministic Asynchronous Automata for Infinite Traces. 379-397
  

Volume 31, Number 5, 1994

• Cliff B. Jones, C. A. Middelburg:
  A Typed Logic of Partial Functions Reconstructed Classically. 399-430
  
• Armin Kühnemann, Heiko Vogler:
  Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic. 431-477
  
• Graham Farr:
  On Problems with Short Certificates. 479-502
  

Volume 31, Number 6, 1994

• Gerhard J. Woeginger:
  Heuristics for Parallel Machine Scheduling with Delivery Times. 503-512
  
• Richard Hull, Jianwen Su:
  Domain Independence and the Relational Calculus. 513-524
  
• Gheorghe Paun, Grzegorz Rozenberg:
  Prescribed Teams of Grammars. 525-537
  
• Aldo de Luca, Stefano Varricchio:
  Well Quasi-Orders and Regular Languages. 539-557
  
• Gennadi Falin, M. Martìn Dìaz, Jesus R. Artalejo:
  Information Theoretic Approximations for the M/G/ 1 Retrial Queue. 559-571
  
• Riccardo Torlone:
  Update Operations in Deductive Databases with Functional Dependencies. 573-600
  

Volume 31, Number 7, 1994

• Uwe Kastens, William M. Waite:
  Modularity and Reusability in Attribute Grammars. 601-627
  
• Astrid R. Rühl:
  On Bounds of Response Time Performance Achievable by Multiclass Single-Server Queues. 629-650
  
• Gilles Bernot, Michel Bidoit, Teodor Knapik:
  Behavioural Approaches to Algebraic Specifications: A Comparative Study. 651-671
  
• Philippe Flajolet, Mordecai J. Golin:
  Mellin Transforms and Asymptotics: The Mergesort Recurrence. 673-696
  

Volume 31, Number 8, 1994

• Astrid Kiehn:
  Comparing Locality and Causality Based Equivalences. 697-718
  
• Dirk Hauschildt, Matthias Jantzen:
  Petri Net Algorithms in the Theory of Matrix Grammars. 719-728
  
• David Spuler:
  Optimal Search Trees Using Two-Way Key Comparisons. 729-740
  
• Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm:
  Tree Automata for Code Selection. 741-760
  
• Karel Culik II, Jarkko Kari:
  On the Power of L-Systems in Image Generation. 761-773
  
• Peter Kirschenhofer, Helmut Prodinger:
  The Path Length of Random Skip Lists. 775-792
  

Last update Mon May 20 16:19:41 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page