Theoretical Computer Science, Volume 225

Volume 225, Numbers 1-2, August 1999

• Maryse Pelletier, Jacques Sakarovitch:
  On the Representation of Finite Deterministic 2-Tape Automata. 1-63
  
• Pierluigi Crescenzi, Luca Trevisan:
  Max NP-completeness Made Easy. 65-79
  
• Zsuzsanna Róka:
  Simulations between Cellular Automata on Cayley Graphs. 81-111
  
• Andrea E. F. Clementi, Luca Trevisan:
  Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. 113-128
  
• Wai-fong Chuan:
  Sturmian Morphisms and alpha-Words. 129-148
  
• Ismo Hakala, Juha Kortelainen:
  On the System of Word Equations x₀uⁱ₁x₁uⁱ₂x₂uⁱ₃x₃=y₀vⁱ₁y₁vⁱ₂y₂vⁱ₃y₃(i=0, 1, 2, ...) in a Free Monoid. 149-161
  
• Pak-Ken Wong:
  Optimal Path Cover Problem on Block Graphs. 163-169
  
• Josep M. Basart, Pere Guitart:
  A Solution for the Coloured Cubes Problem. 171-176
  
• Manfred Göbel:
  The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order. 177-184
  
• Jack H. Lutz, David L. Schweizer:
  Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. 185-194