P Systems with Valuations

We propose a new variant of P systems having as simple as possible evolution rules in which the communication of objects and the membrane dissolving are regulated by a valuation mapping (a morphism which assigns to each word an integer value). Two NP-complete problems are solved by P systems with valuation in linear time.

[1]  Andrei Păun,et al.  On membrane computing based on splicing , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[2]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

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

[4]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[5]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[6]  Gheorghe Paun,et al.  On Synchronization in P Systems , 1999, Fundam. Informaticae.

[7]  Gheorghe Paun,et al.  On the Power of Membrane Computing , 1999, J. Univers. Comput. Sci..

[8]  Lila Kari,et al.  Using DNA to solve the Bounded Post Correspondence Problem , 2000, MCU.

[9]  Gheorghe Paun,et al.  Membrane Computing with External Output , 2000, Fundam. Informaticae.

[10]  Daniel Le Métayer,et al.  A parallel machine for multiset transformation and its programming style , 1988, Future Gener. Comput. Syst..

[11]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[12]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[13]  Gheorghe Paun,et al.  Simulating H Systems by P Systems , 2000, J. Univers. Comput. Sci..

[14]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

[15]  Sartaj Sahni,et al.  On the Computational Complexity of Scheme Equivalence , 1974 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .