Theoretical Computer Science, Volume 327

Volume 327, Number 1-2, October 2004

• H. Peter Gumm:
  Preface. 1-2
  

• Falk Bartels, Ana Sokolova, Erik P. de Vink:
  A hierarchy of probabilistic system types. 3-22
  
• Hubie Chen, Riccardo Pucella:
  A coalgebraic approach to Kleene algebra with tests. 23-44
  
• Corina Cîrstea:
  A compositional approach to defining logics for coalgebras. 45-69
  
• Jesse Hughes, Bart Jacobs:
  Simulations in coalgebra. 71-108
  
• Clemens Kupke, Alexander Kurz, Yde Venema:
  Stone coalgebras. 109-134
  
• Marina Lenisa, John Power, Hiroshi Watanabe:
  Category theory for operational semantics. 135-154
  
• Ralph Matthes, Tarmo Uustalu:
  Substitution in non-wellfounded syntax with variable binding. 155-174
  
• Alessandra Palmigiano:
  A coalgebraic view on positive modal logic. 175-195
  
• Grigore Rosu:
  Behavioral abstraction is hiding information. 197-221
  

Volume 327, Number 3, November 2004

• Zoltán Ésik, Zoltán Fülöp:
  Foreword. 223-224
  

• Dimitry S. Ananichev, Mikhail V. Volkov:
  Synchronizing monotonic automata. 225-239
  
• Jean-Marc Champarnaud, Fabien Coulon:
  NFA reduction algorithms by means of regular inequalities. 241-253
  
• Flavio D'Alessandro, Stefano Varricchio:
  Well quasi-orders and context-free grammars. 255-268
  
• Diego de Falco, Massimiliano Goldwurm, Violetta Lonati:
  Frequency of symbol occurrences in bicomponent stochastic models. 269-300
  
• Dieter Hofbauer, Johannes Waldmann:
  Deleting string rewriting systems preserve regularity. 301-317
  
• Markus Holzer, Barbara König:
  On deterministic finite automata and syntactic monoid size. 319-347
  
• Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur:
  Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. 349-373
  
• Andreas Malcher:
  Minimizing finite automata is computationally hard. 375-390