Fundamenta Informaticae, Volume 91

Volume 91, Number 1, 2009

• Artiom Alhazov, Carlos Martín-Vide, Bianca Truthe, Jürgen Dassow, Yurii Rogozhin:
  On Networks of Evolutionary Processors with Nodes of Two Types. 1-15
  Electronic Edition (link) BibTeX
• Artiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan:
  Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. 17-34
  Electronic Edition (link) BibTeX
• Dorothea Baumeister, Jörg Rothe:
  Satisfiability Parsimoniously Reduces to the Tantrix^TM Rotation Puzzle Problem. 35-51
  Electronic Edition (link) BibTeX
• Mark Burgin, Eugene Eberbach:
  Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms. 53-77
  Electronic Edition (link) BibTeX
• John Fisher, Marc Bezem:
  Skolem Machines. 79-103
  Electronic Edition (link) BibTeX
• Hermann Gruber, Markus Holzer, Martin Kutrib:
  More on the Size of Higman-Haines Sets: Effective Constructions. 105-121
  Electronic Edition (link) BibTeX
• Turlough Neary, Damien Woods:
  Four Small Universal Turing Machines. 123-144
  Electronic Edition (link) BibTeX
• K. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, Maurice Margenstern:
  Array P Systems and t.Communication. 145-159
  Electronic Edition (link) BibTeX
• Hiroshi Umeo, Takashi Yanagihara:
  A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem - A Geometrical Approach. 161-178
  Electronic Edition (link) BibTeX
• Damien Woods, Turlough Neary:
  Small Semi-Weakly Universal Turing Machines. 179-195
  Electronic Edition (link) BibTeX