Theoretical Computer Science, Volume 174

Volume 174, Numbers 1-2, 15 March 1997

• Igor Litovsky, Ludwig Staiger:
  Finite Acceptance of Infinite Words. 1-21
  
• Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
  Hierarchically Specified Unit Disk Graphs. 23-65
  
• Felipe Bracho, Manfred Droste, Dietrich Kuske:
  Representation of Computations in Concurrent Automata by Dependence Orders. 67-96
  
• Sanjeev Arora, Ronald Fagin:
  On Winning Strategies in Ehrenfeucht-Fraïssé Games. 97-121
  
• Pekka Orponen:
  Computing with Truly Asynchronous Threshold Logic Networks. 123-136
  
• Matthias Krause, Pavel Pudlák:
  On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. 137-156
  
• Paola Favati, Grazia Lotti, Luciano Margara:
  Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos. 157-170
  
• Marie-Line Santini-Bouchard:
  Echanges de trois intervalles et suites minimales. 171-191
  
• Piotr Berman, Andrzej Lingas:
  A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. 193-202
  
• Petr Kurka:
  On Topological Dynamics of Turing Machines. 203-216
  
• Alain Finkel, Pierre McKenzie:
  Verifying Identical Communicating Processes is Undecidable. 217-230
  
• John Mullins:
  On an Effective Hierarchy of Communicating Processes: Separation Principle and Testing. 231-246
  
• Yohei Yamasaki:
  The Arithmetic of Reversed Positional Games. 247-249
  
• Satoshi Kobayashi, Takashi Yokomori:
  Learning Approximately Regular Languages with Reversible Languages. 251-257
  
• Nobuyuki Takahashi:
  Various Hierarchies of omega-regular Sets. 259-268
  
• Paavo Turakainen:
  The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions. 269-274
  
• Guo-Qiang Zhang, E. Rodney Canfield:
  The End of Pumping? 275-279