Abstract
P systems with graph productions were introduced by Freund in 2004. It was shown that such a variant of P system can generate any recursively enumerable language of weakly connected graphs. In this paper, we consider such P systems where the input is any connected graph and each graph production is labelled over an alphabet. We name the system as Process Guided P System where the computation is guided by a string over the set of labels. The set of all strings over the label alphabet which results in the halting computation of the system forms a guiding language of the system. We compare such guiding languages with Chomsky hierarchy. Two direct applications of this variant are also given.
Similar content being viewed by others
References
Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Freund, R., Oswald, M.: P systems with local graph productions. New Gener. Comput. 22, 365–375 (2004)
Khaira, T., Yamina, M.: Colouring graph by the Kernel P system. Int. J. Reason. Intell. Syst. 7, 286–295 (2015)
Fernández, M., Kirchner, H., Pinaud, B..: Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework. Research Report, Inria, France (2016)
Păun, Gh, Sakaibara, Y., Yokomori, T.: P systems on graphs of restricted forms. Publicationes Mathematicae Debrecen 60, 635–660 (2002)
Maribel, F., Hélène, K., Oliver, N.: A strategy language for graph rewriting. In: International Symposium on Logic-Based Program Synthesis and Transformation, pp. 173–188 (2011)
Ramanujan, A., Krithivasan, K..: Control words of transition P systems. In: Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012), Advances in Intelligent Systems and Computing, vol. 201, pp. 145–155 (2013)
Ramanujan, A., Krithivasan, K.: Control languages associated with spiking neural P systems. Romanian J. Inf. Sci. Technol. 15(4), 301–318 (2012)
Sureshkumar, W., Rama, R.: Chomsky hierarchy control on isotonic array P systems. Int. J. Pattern Recognit. Artif. Intell. 30(1650004), 1–20 (2016)
Zhang, X., Liu, Y., Luo, B., Pan, L.: Computational power of tissue P systems for generating control languages. Inf. Sci. 278, 285–297 (2014)
Mahalingam, K., Paul, P., Mäkinen, E.: On derivation languages of a class of splicing systems. Acta Cybern. (2017, Accepted)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg, pp. 1–3 (1997)
Rosselló, F., Valiente, G.: Chemical graphs, chemical reaction graphs, and chemical graph transformation. In: Proceedings of the International Workshop on Graph-Based Tools (GraBaTs 2004) Graph-Based Tools 2004–2005), Electronic Notes in Theoretical Computer Science, vol. 127, no. 1, pp. 157–166 (2005)
Acknowledgements
This work was funded by the Project No: SB/S4/MS-865/14, Department of Science and Technology, Government of India.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sureshkumar, W., Mahalingam, K. & Rama, R. Labelled graph rules in P systems. Iran J Comput Sci 1, 133–145 (2018). https://doi.org/10.1007/s42044-018-0010-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s42044-018-0010-9