Theoretical Computer Science, Volume 200

Volume 200, Numbers 1-2, 28 June 1998

• Klaus Barthelmann:
  Nondeterministic Operations on Finite Relational Structures. 1-44
  
• Vincent Schmitt:
  Stable Trace Automata vs. Full Trace Automata. 45-100
  
• Lothar M. Schmitt, Chrystopher L. Nehaniv, Robert H. Fujii:
  Linear Analysis of Genetic Algorithms. 101-134
  
• Wieslaw Zielonka:
  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. 135-183
  
• Peter Jeavons:
  On the Algebraic Structure of Combinatorial Problems. 185-204
  
• Tero Harju, Lucian Ilie:
  On Quasi Orders of Words and the Confluence Property. 205-224
  
• Matthew Hennessy, Julian Rathke:
  Bisimulations for a Calculus of Broadcasting Systems. 225-260
  
• Eric Rivals, Jean-Paul Delahaye:
  Optimal Representation in Average Using Kolmogorov Complexity. 261-287
  
• Jaco van de Pol:
  Operational Semantics of Rewriting with Priorities. 289-312
  
• Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson:
  Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution. 313-334
  
• Daniele Mundici, Nicola Olivetti:
  Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz. 335-366