Theoretical Computer Science, Volume 230

Volume 230, Numbers 1-2, 6 January 2000

• Bruno Apolloni, Claudio Gentile:
  P-Sufficient Statistics for PAC Learning k-term-DNF Formulas through Enumeration. 1-37
  
• Colin de la Higuera, Francisco Casacuberta:
  Topology of Strings: Median String is NP-Complete. 39-48
  
• Klaus Sutner:
  sigma-Automata and Chebyshev-Polynomials. 49-73
  
• Zhi-Zhong Chen:
  Efficient Algorithms for Acyclic Colorings of Graphs. 75-95
  
• Nataliya Chekhova:
  Covering Numbers of Rotations. 97-116
  
• John T. Baldwin, Saharon Shelah:
  On the Classifiability of Cellular Automata. 117-129
  
• Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener:
  Identification of Partial Disjunction, Parity, and Threshold Functions. 131-147
  
• Brunella Gerla:
  Conditioning a State by a Lukasiewicz Event: A Probabilistic Approach to Ulam Games. 149-166
  
• Ferdinando Cicalese, Ugo Vaccaro:
  Optimal Strategies Against a Liar. 167-193
  
• Dennis M. Breuker, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
  Solving 8×8 Domineering. 195-206
  
• Mark Ettinger:
  A Metric for Positional Games. 207-219
  
• Rémy Malgouyres:
  Homotopy in Two-Dimensional Digital Images. 221-233
  
• Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik:
  The Variety of Kleene Algebras with Conversion is not Finitely Based. 235-245
  
• Peter R. J. Asveld, Anton Nijholt:
  The Inclusion Problem for Some Subclasses of Context-Free Languages. 247-256