Contents of Fundamenta Informaticae Volume 91


Number 1,  2009

Number 2,  2009

Number 3-4,  2009

 


Contents of Volume 91, Number 1, 2009

Click on title for abstract


Machines, Computations and Universality, Part I. Preface  

On Networks of Evolutionary Processors with Nodes of Two Types
Artiom Alhazov, Jürgen Dassow, Carlos Martín-Vide, Yurii Rogozhin, Bianca Truthe

Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan

Satisfiability Parsimoniously Reduces to the Tantrix Rotation Puzzle Problem
Dorothea Baumeister and Jörg Rothe

Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Mark Burgin, Eugene Eberbach

Skolem Machines
John Fisher, Marc Bezem

More on the Size of Higman-Haines Sets: Effective Constructions
Hermann Gruber, Markus Holzer, Martin Kutrib

Four Small Universal Turing Machines
Turlough Neary and Damien Woods

Array P Systems and t-Communication
K. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, Maurice Margenstern

A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem - A Geometrical Approach Hiroshi Umeo and Takashi Yanagihara

Small Semi-Weakly Universal Turing Machines
Damien Woods, Turlough Neary


Contents of Volume 91, Number 2, 2009

Click on title for abstract


Machines, Computations and Universality, Part II. Preface

Intrinsically universal one-dimensional quantum cellular automata in two flavours
Pablo Arrighi, Renan Fargetton,  Zizhu Wang

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
Alberto Bertoni,  Massimiliano Goldwurm,  Violetta Lonati

Modelling of Complex Systems: Systems as Dataflow Machines
Simon Bliudze, Daniel Krob

Flat Parametric Counter Automata
Marius Bozga,  Radu Iosif,  Yassine Lakhnech

Highly Undecidable Problems about Recognizability by Tiling Systems
Olivier Finkel

Quantum Testers for Hidden Group Properties
Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen

On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
Gabriel Istrate

Universal Hard Interaction for Clockless Computation
Dem Glücklichen schlägt keine Stunde!

Sylvain Lippi

On the Computational Power of Querying the History
Alexei Lisitsa,  Igor Potapov

Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Iain A. Stewart


Contents of Volume 91, Number 3-4, 2009

Click on title for abstract


Associativity of Infinite Synchronized Shuffles and Team Automata
Maurice H. ter Beek, Jetty Kleijn

Behaviour Preservation of a Biological Regulatory Network when Embedded into a Larger Network
Gilles Bernot, Fariza Tahi

Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Partha Bhowmick, Bhargab B. Bhattacharya

Analysis of Components for Generalization using Multidimensional Scaling
Robertas Damasevicius

A Further Improved Online/Offline Signature Scheme
Chong-zhi Gao, Zheng-an Yao

Hypergraphs for Generic Lossless Image Compression
Luc Gillibert and Alain Bretto

Adjective Sense Disambiguation at the Border Between Unsupervised and Knowledge-Based Techniques
Florentina Hristea, Marius Popescu

A Fast VQ Codebook Generation Algorithm Based on Otsu Histogram Threshold
Chang-Chin Huang,  Du-Shiau Tsai,  Gwoboa Horng

Reversible Data Hiding Based on Three-Circular-Pixel Difference Expansion
Ching-Chiuan Lin,  Shun-Ping Yang,  Nien-Lin Hsueh

An Information-Hiding Scheme Based on Quantization-Based Embedding Technique
Tzu-Chuen Lu,  Chin-Chen Chang,  Yi-Long Liu

Series-Parallel Automata and Short Regular Expressions
Nelma Moreira and Rogério Reis

Handling Inconsistency In Distributed Software Requirements Specifications Based On Prioritized Merging
Kedian Mu, Weiru Liu, Zhi Jin, Ruqian Lu, Anbu Yue, David Bell