Advertisement

APCol Systems with Agent Creation

  • Lucie CiencialováEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11399)

Abstract

We introduce a specific type of rules for APCol systems (Automaton-like P colonies), variants of P colonies where the environment of the agents is given by a string and during functioning the agents change their own states and process the string similarly to automata. These rules enrich the actioning of APCol systems by agent creation. Finally, we show that even APCol systems with agent creation, systems without inner structure, can solve 3SAT in linear time.

Keywords

P colony Membrane systems String processing SAT 

Notes

Acknowledgments

This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPU II) project IT4Innovations excellence in science - LQ1602, by SGS/13/2016.

References

  1. 1.
    Cienciala, L., Ciencialová, L., Csuhaj-Varjú, E.: Towards on P colonies processing strings. In: Proceedings of BWMC 2014, Sevilla, pp. 102–118. Fénix Editora, Sevilla (2014)Google Scholar
  2. 2.
    Ciencialová, L., Csuhaj-Varjú, E., Cienciala, L., Sosík, P.: P colonies. Bull. Int. Membr. Comput. Soc. 1(2), 119–156 (2016)zbMATHGoogle Scholar
  3. 3.
    Csuhaj-Varjú, E., Kelemen, J., Păun, G., Dassow, J. (eds.): Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers Inc., Newark (1994)zbMATHGoogle Scholar
  4. 4.
    Kelemenová, A.: P colonies, chap. 23.1. In: Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, pp. 584–593. Oxford University Press, Oxford (2010)Google Scholar
  5. 5.
    Kelemen, J., Kelemenová, A., Păun, G.: Preview of P colonies: a biochemically inspired computing model. In: Workshop and Tutorial Proceedings. Ninth International Conference on the Simulation and Synthesis of Living Systems (ALIFE IX), Boston, MA, pp. 82–86 (2004)Google Scholar
  6. 6.
    Kelemen, J., Kelemenová, A.: A grammar-theoretic treatment of multiagent systems. Cybern. Syst. 23(6), 621–633 (1992)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Krishna, S.N., Rama, R.: A variant of P systems with active membranes: solving NP-complete problems. Rom. J. Inf. Sci. Technol. 2(4), 357–367 (1999)Google Scholar
  8. 8.
    Mutyam, M., Krithivasan, K.: P systems with membrane creation: universality and efficiency. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 276–287. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45132-3_19CrossRefzbMATHGoogle Scholar
  9. 9.
    Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press Inc., New York (2010)Google Scholar
  10. 10.
    Păun, Gh.: P systems with active membranes: attacking NP-complete problems. J. Autom. Lang. Comb. 6(1), 75–90 (2001)Google Scholar
  11. 11.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages I-III. Springer, Heidelberg (1997)Google Scholar
  12. 12.
    Sosík, P.: Solving a PSPACE-complete problem by P systems with active membranes. In: Cavaliere, M., Martín-Vide, C., Păun, Gh. (eds.) Proceedings of the Brainstorming Week on Membrane Computing, Report GRLMC 26/03, pp. 305–312 (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of Computer Science and Research Institute of the IT4Innovations Centre of ExcellenceSilesian University in OpavaOpavaCzech Republic

Personalised recommendations