Eilenberg P Systems

A class of P systems, called EP systems, with string objects processed by evolution rules distributed alongside the transitions of an Eilenberg machine, is introduced. A parallel variant of EP systems, called EPP systems, is also defined and the power of both EP and EPP systems is investigated in relationshipwith three parameters: number of membranes, states and set of distributed rules. It is shown that EPP systems represent a promising framework for solving NP-complete problems. In particular linear time solutions are provided for the SAT problem.

[1]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[2]  Marian Gheorghe.  Generalised Stream X-Machines and Cooperating Distributed Grammar Systems , 2000, Formal Aspects of Computing.

[3]  Gheorghe Păun,et al.  Computing with cells and atoms in a nutshells , 2000 .

[4]  Sungchul Ji,et al.  The Bhopalator: An Information/Energy Dual Model of the Living Cell (II) , 2002, Fundam. Informaticae.

[5]  Mike Holcombe,et al.  Computational Models of Cells and Tissues: Machines, Agents and Fungal Infection , 2001, Briefings Bioinform..

[6]  Petros Kefalas,et al.  Formal Modelling of Reactive Agents as an Aggregation of Simple Behaviours , 2002, SETN.

[7]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[8]  C. J. Harwood.  Correct Systems: Building a Business Process Solution , 2000 .

[9]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[10]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[11]  Rudolf Freund,et al.  On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars , 2001, MCU.

[12]  Gabriel Ciobanu.  Distributed algorithms over communicating membrane systems. , 2003, Bio Systems.

[13]  Raghavan Rama,et al.  P Systems with Replicated Rewriting , 2001, J. Autom. Lang. Comb..

[14]  Gabriel Ciobanu,et al.  P System Software Simulator , 2002, Fundam. Informaticae.

[15]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[16]  Gheorghe Paun,et al.  Grammar Systems , 1997, Handbook of Formal Languages.

[17]  P Kefalas,et al.  Computational models of collective foraging. , 2001, Bio Systems.

[18]  Mike Holcombe.  X-machines as a basis for dynamic system specification , 1988, Softw. Eng. J..

[19]  Gabriel Ciobanu,et al.  Client-Server P Systems in Modeling Molecular Interaction , 2002, WMC-CdeA.

[20]  Mike Holcombe.  What are X-Machines? , 2000, Formal Aspects of Computing.

[21]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[22]  Marian Gheorghe,et al.  Communicating Stream X-Machines Systems are no more than X-Machines , 1999, J. Univers. Comput. Sci..

[23]  Giancarlo Mauri,et al.  On three variants of rewriting P systems , 2003, Theor. Comput. Sci..

[24]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.