Theoretical Computer Science, Volume 400

Volume 400, Numbers 1-3, June 2008

• Mathieu Sablik:
  Directional dynamics for cellular automata: A sensitivity to initial condition approach. 1-18
  

• Achim Blumensath:
  On the structure of graphs in the Caucal hierarchy. 19-45
  
• Philippe Moser:
  Martingale families and dimension in P. 46-61
  
• Yossi Moshe:
  On some questions regarding k -regular and k -context-free sequences. 62-69
  
• Claribet Piña, Carlos Uzcátegui:
  Reconstruction of a word from a multiset of its factors. 70-83
  
• Christine Cheng, Eric McDermid, Ichiro Suzuki:
  A unified approach to finding good stable matchings in the hospitals/residents setting. 84-99
  
• Jurijs Kirillovs:
  Polyomino coloring and complex numbers. 100-112
  
• Petr Ambroz, Zuzana Masáková, Edita Pelantová:
  Matrices of 3-iet preserving morphisms. 113-136
  
• Caixia Jing, Guochun Tang, Xingsan Qian:
  Heuristic algorithms for two machine re-entrant flow shop. 137-143
  
• Jean Berstel, Christophe Reutenauer:
  Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. 144-158
  
• Ojas Parekh:
  Approximation algorithms for partially covering with edges. 159-168
  
• Dalia Krieger:
  On stabilizers of infinite words. 169-181
  
• John Rhodes, Pedro V. Silva:
  Turing machines and bimachines. 182-224
  

• Tullio Ceccherini-Silberstein, Michel Coornaert:
  A generalization of the Curtis-Hedlund theorem. 225-229
  
• Zhendong Shao, David Zhang:
  Improved upper bounds on the L(2, 1) -labeling of the skew and converse skew product graphs. 230-233