Theoretical Computer Science, Volume 231

Volume 231, Number 1, 17 January 2000

• Pascal Caron:
  LANGAGE: A Maple Package for Automaton Characterization of Regular Languages. 5-15
  
• Mehryar Mohri, Fernando C. N. Pereira, Michael Riley:
  The Design Principles of a Weighted Finite-State Transducer Library. 17-32
  
• Max Silberztein:
  INTEX: An FST Toolbox. 33-46
  
• Helmut Lescow, Jens Vöge:
  Minimal Separating Sets for Acceptance Conditions in Muller Automata. 47-57
  
• A. N. Trahtman:
  Optimal Estimation on the Order of Local Testability of Finite Automata. 59-74
  
• Djelloul Ziadi:
  Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. 75-87
  
• Jean-Luc Ponty:
  An Efficient Null-Free Procedure for Deciding Regular Language Membership. 89-101
  
• Kai Salomaa, Xiuming Wu, Sheng Yu:
  Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. 103-111
  
• Janusz A. Brzozowski, Radu Negulescu:
  Automata of Asynchronous Behaviors. 113-128
  
• Denis Maurel:
  Pseudo-Minimal Transducer. 129-139
  

Volume 231, Number 2, 28 January 2000

• Paolo Boldi, Sebastiano Vigna:
  The Turing closure of an Archimedean field. 143-156
  
• Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori:
  On the universality of Post and splicing systems. 157-170
  
• Claudio Ferretti, Giancarlo Mauri, Claudio Zandron:
  Nine test tubes generate any RE language. 171-180
  
• Katsunobu Imai, Kenichi Morita:
  A computation-universal two-dimensional 8-state triangular reversible cellular automaton. 181-191
  
• Lila Kari, Greg Gloor, Sheng Yu:
  Using DNA to solve the Bounded Post Correspondence Problem. 193-203
  
• Arnaud Maes:
  More on morphisms and almost-periodicity. 205-215
  
• Maurice Margenstern:
  Frontier between decidability and undecidability: a survey. 217-251
  
• Christian Michaux, Christophe Troestler:
  Isomorphism theorem for BSS recursively enumerable sets over real closed fields. 253-273
  
• Gheorghe Paun:
  DNA computing based on splicing: universality results. 275-296
  
• Hiroshi Sakamoto, Daisuke Ikeda:
  Intractability of decision problems for finite-memory automata. 297-308
  
• Géraud Sénizergues:
  Complete formal systems for equivalence problems. 309-334