Theoretical Computer Science, Volume 183

Volume 183, Number 1, 30 August 1997

• Masami Ito, Lila Kari, Gabriel Thierrin:
  Insertion and Deletion Closure of Languages. 3-19
  
• Danny Raz:
  Length Considerations in Context-Free Languages. 21-32
  
• Lucian Ilie:
  On Computational Complexity of Contextual Languages. 33-44
  
• Aldo de Luca:
  Sturmian Words: Structure, Combinatorics, and Their Arithmetics. 45-82
  
• Christian Choffrut, Tero Harju, Juhani Karhumäki:
  A Note on Decidability Questions on Presentations of Word Semigroups. 83-92
  
• Oded Maler, Ludwig Staiger:
  On Syntactic Congruences for Omega-Languages. 93-112
  
• Juha Honkala, Werner Kuich:
  On Lindenmayerian Algebraic Power Series. 113-142
  
• Juha Honkala:
  On Lindenmayerian Algebraic Sequences. 143-154
  

Volume 183, Number 2, 15 September 1997

• Anne Elisabeth Haxthausen:
  Order-Sorted Algebraic Specifications with Higher-Order Functions. 157-185
  
• Angelo Montanari, Maarten de Rijke:
  Two-sorted Metric Temporal Logics. 187-214
  
• Mads Dam:
  On the Decidability of Process Equivalences for the pi-Calculus. 215-228
  
• Allan Cheng:
  Petri Nets, Traces, and Local Model Checking. 229-251
  
• Pierre Collette, Edgar Knapp:
  A Foundation for Modular Reasoning About Safety and Progress Properties of State-Based Concurrent Programs. 253-279
  
• Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi:
  Confluence in Concurrent Constraint Programming. 281-315