Contents of Fundamenta Informaticae Volume 49.

Number 1-3, January 2002
Number 4, January-February 2002

Contents of Volume 49, Number 1-3, January 2002

Click on title for abstract

Preface i-ii

ReMembrane Systems with Coupled Transport: Universality and Normal Forms 
Carlos Martín-Vide, Andrei Paun, Gheorghe P aun and Grzegorz Rozenberg

P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines) 
Joaquin Aguado, Tudor Balanescu, Tony Cowling, Marian Gheorghe, Mike Holcombe and Florentin Ipate

The Relevance of Cell Membranes for P Systems. General Aspects 
Ioan I. Ardelean

Recursive Calculus with Membranes
Adrian Atanasiu and Carlos Martín-Vide

P System Software Simulator 
Gabriel Ciobanu and Dorin Paraschiv

Gene Expression by Software Mechanisms
Gabriel Ciobanu, Bogdan Tanasa

GP Systems with Forbidding Context 
Rudolf Freund and Marion Oswald

A Direct Construction of a Universal P System 
Pierluigi Frisco, Hendrik Jan Hoogeboom and Paul Sant

The Topological Structures of Membrane Computing 
Jean-Louis Giavitto and Olivier Michel

The Bhopalator: An Information/Energy Dual Model of the Living Cell (II) 
Sungchul Ji

On the Power of P Systems with Contextual Rules 
S.N. Krishna, K. Lakshmanan, R. Rama

Contextual P Systems 
Kamala Krithivasan and Mutyam Madhu

Closure Properties of Multiset Language Families 
Manfred Kudlek and Victor Mitrana

DNA and Membrane Algorithms for SAT
Vincenzo Manca

Membranes Versus DNA
Solomon Marcus

On the Power of P Systems with DNA-Worm-Objects 
José L. Maté, A. Rodríguez-Patón and Andrés Silva

A C Library for Simulating P Systems
Dan V Nicolau Jr, Gerardin Solana, Florin Fulga and Dan V Nicolau

Simulations of Photosynthesis by a K-Subset Transforming System with Membrane  
Taishin Yasunobu Nishida

A Formalization of Transition P Systems 
Mario J. Pérez-Jiménez and Fernando Sancho-Caparrini

Simulating Turing Machines by P Systems with External Output 
Álvaro Romero-Jiménez and Mario J. Pérez-Jiménez

Contents of Volume 49, Number 4, January-February  2002

Click on title for abstract

A Fixed-point Characterization of a Deontic Logic of Regular Action 
Jan Broersen, Roel Wieringa and John-Jules Meyer

On the Injectivity of the Parikh Matrix Mapping 
Adrian Atanasiu, Carlos Martín-Vide and Alexandru Mateescu

Relaxed Update and Partition Network Games
Hans L. Bodlaender, Michael J. Dinneen and Bakhadyr Khoussainov

Optimal Unification and Learning Algorithms for Categorial Grammars 
Barbara Dziemidowicz

Processing Indefinite Deductive Databases under the Possible Model Semantics 
C.A. Johnson

A New Bayesian Tree Learning Method with Reduced Time and Space Complexity
Mieczysław Alojzy Kłopotek

PathLog: a Query Language for Schemaless Databases of Partially Labeled Objects 3
Tadeusz Pankowski