Theoretical Computer Science, Volume 328

Volume 328, Number 1-2, November 2004

• Oscar H. Ibarra:
  Editorial. 1-
  

• Cyril Allauzen, Mehryar Mohri:
  An optimal pre-determinization algorithm for weighted transducers. 3-18
  
• Xiang Fu, Tevfik Bultan, Jianwen Su:
  Conversation protocols: a formalism for specification and verification of reactive electronic services. 19-37
  
• Franck Guingne, Florent Nicart, André Kempe:
  Acyclic networks maximizing the printing complexity. 39-51
  
• Dietrich Kuske, Ingmar Meinecke:
  Branching automata with costs - a way of reflecting parallelism in costs star. 53-75
  
• Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch:
  Introducing VA_UCANSON. 77-96
  
• Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
  Ternary directed acyclic word graphs. 97-111
  
• Bala Ravikumar, Gerry Eisman:
  Weak minimization of DFA - an algorithm and applications. 113-133
  
• Hellis Tamm, Esko Ukkonen:
  Bideterministic automata and minimal representations of regular languages. 135-149
  
• A. N. Trahtman:
  Reducing the time complexity of testing for local threshold testability. 151-160