Fundamenta Informaticae, Volume 91

Volume 91, Number 1, 2009

Machines, Computations and Universality, Part I

• 
  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
• 
  Artiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan:
  Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. 17-34
• 
  Dorothea Baumeister, Jörg Rothe:
  Satisfiability Parsimoniously Reduces to the Tantrix^TM Rotation Puzzle Problem. 35-51
• 
  Mark Burgin, Eugene Eberbach:
  Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms. 53-77
• 
  John Fisher, Marc Bezem:
  Skolem Machines. 79-103
• 
  Hermann Gruber, Markus Holzer, Martin Kutrib:
  More on the Size of Higman-Haines Sets: Effective Constructions. 105-121
• 
  Turlough Neary, Damien Woods:
  Four Small Universal Turing Machines. 123-144
• 
  K. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, Maurice Margenstern:
  Array P Systems and t.Communication. 145-159
• 
  Hiroshi Umeo, Takashi Yanagihara:
  A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem - A Geometrical Approach. 161-178
• 
  Damien Woods, Turlough Neary:
  Small Semi-Weakly Universal Turing Machines. 179-195

Volume 91, Number 2, 2009

Machines, Computations and Universality, Part II

• 
  Pablo Arrighi, Renan Fargetton, Zizhu Wang:
  Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours. 197-230
• 
  Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati:
  The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases. 231-249
• 
  Simon Bliudze, Daniel Krob:
  Modelling of Complex Systems: Systems as Dataflow Machines. 251-274
• 
  Marius Bozga, Radu Iosif, Yassine Lakhnech:
  Flat Parametric Counter Automata. 275-303
• 
  Olivier Finkel:
  Highly Undecidable Problems about Recognizability by Tiling Systems. 305-323
• 
  Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen:
  Quantum Testers for Hidden Group Properties. 325-340
• 
  Gabriel Istrate:
  On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT). 341-356
• 
  Sylvain Lippi:
  Universal Hard Interaction for Clockless ComputationDem Glücklichen schlägt keine Stunde! 357-394
• 
  Alexei Lisitsa, Igor Potapov:
  On the Computational Power of Querying the History. 395-409
• 
  Iain A. Stewart:
  Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws. 411-435

Volume 91, Numbers 3-4, 2009

• 
  Maurice H. ter Beek, Jetty Kleijn:
  Associativity of Infinite Synchronized Shuffles and Team Automata. 437-461
• 
  Gilles Bernot, Fariza Tahi:
  Behaviour Preservation of a Biological Regulatory Network when Embedded into a Larger Network. 463-485
• 
  Partha Bhowmick, Bhargab B. Bhattacharya:
  Real Polygonal Covers of Digital Discs - Some Theories and Experiments. 487-505
• 
  Robertas Damasevicius:
  Analysis of Components for Generalization using Multidimensional Scaling. 507-522
• 
  Chong-zhi Gao, Zheng-an Yao:
  A Further Improved Online/Offline Signature Scheme. 523-532
• 
  Luc Gillibert, Alain Bretto:
  Hypergraphs for Generic Lossless Image Compression. 533-546
• 
  Florentina Hristea, Marius Popescu:
  Adjective Sense Disambiguation at the Border Between Unsupervised and Knowledge-Based Techniques. 547-562
• 
  Chang-Chin Huang, Du-shiau Tsai, Gwoboa Horng:
  A Fast VQ Codebook Generation Algorithm Based on Otsu Histogram Threshold. 563-579
• 
  Ching-Chiuan Lin, Shun-Ping Yang, Nien-Lin Hsueh:
  Reversible Data Hiding Based on Three-Circular-Pixel Difference Expansion. 581-595
• 
  Tzu-Chuen Lu, Chin-Chen Chang, Yi-Long Liu:
  An Information-Hiding Scheme Based on Quantization-Based Embedding Technique. 597-610
• 
  Nelma Moreira, Rogério Reis:
  Series-Parallel Automata and Short Regular Expressions. 611-629
• 
  Kedian Mu, Weiru Liu, Zhi Jin, Ruqian Lu, Anbu Yue, David A. Bell:
  Handling Inconsistency In Distributed Software Requirements Specifications Based On Prioritized Merging. 631-670