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.
Unable to display preview. Download preview PDF.
- 2.C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.Google Scholar
- 4.J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer Verlag, Berlin, 1989.Google Scholar
- 5.S. Eilenberg, Automata, Languages and Machines, Academic Press, 1974.Google Scholar
- 6.C. Ferretti, G. Mauri, Gh. Păun, C. Zandron, On Three Variants of Rewriting P Systems, Pre-proceedings of Workshop on Membrane Computing (WMCCdeA2001), (C. Martin-Vide, Gh. Păun, eds), Curtea de Argeş, Romania, August 2001, 63–76, and Theor. Comp. Sci., to appear.Google Scholar
- 7.R. Freund, Gh. Păun, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, Proc. Conf. Universal Machines and Computations, Chisinau, 2001 (M. Margenstern and Y. Rogozhin, eds.), Springer-Verlag, Berlin, 2001.Google Scholar
- 13.M. Holcombe, F. Ipate, Correct Systems Building a Business Process Solution, Springer, Applied Computing Series, 1998.Google Scholar
- 15.S. Ji, The Bhopalator, An information/energy dual model of the living cell, Preproceedings of Workshop on Membrane Computing (WMC-CdeA2001) (C. Martin-Vide, Gh. Păun, eds), Curtea de Argeş, Romania, August 2001, 123–141, and Fundamenta Informaticae, 49 (2002), 147–165.Google Scholar
- 16.P. Kefalas, Formal modelling of reactive agents as an aggregation of simple behaviours, LNAI 2308 (I.P. Vlahavas, C.D. Syropoulos, eds.), Springer, 461–472, 2002.Google Scholar
- 17.Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, 1978.Google Scholar
- 18.S.N. Krishna, R. Rama, On the power of P systems with sequential and parallel rewriting, Intern. J. Computer Math., 77, 1–2 (2000), 1–14.Google Scholar
- 20.A. Păun, P systems with string objects: Universality results, Pre-proceedings of Workshop on Membrane Computing (WMC-CdeA2001) (C. Martin-Vide, Gh. Păun, eds), Curtea de Arges, Romania, August 2001, 229–241.Google Scholar
- 22.Gh. Păun, Membrane Computing. An Introduction, Springer, Berlin, 2002.Google Scholar