Skip to main content
Springer Nature Link
Log in

Labelled graph rules in P systems

  • Original Article
  • Published:
Iran Journal of Computer Science Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)

  2. Freund, R., Oswald, M.: P systems with local graph productions. New Gener. Comput. 22, 365–375 (2004)

    Article  MATH  Google Scholar 

  3. Khaira, T., Yamina, M.: Colouring graph by the Kernel P system. Int. J. Reason. Intell. Syst. 7, 286–295 (2015)

    Google Scholar 

  4. Fernández, M., Kirchner, H., Pinaud, B..: Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework. Research Report, Inria, France (2016)

  5. Păun, Gh, Sakaibara, Y., Yokomori, T.: P systems on graphs of restricted forms. Publicationes Mathematicae Debrecen 60, 635–660 (2002)

    MathSciNet  MATH  Google Scholar 

  6. 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)

  7. 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)

  8. Ramanujan, A., Krithivasan, K.: Control languages associated with spiking neural P systems. Romanian J. Inf. Sci. Technol. 15(4), 301–318 (2012)

    Google Scholar 

  9. Sureshkumar, W., Rama, R.: Chomsky hierarchy control on isotonic array P systems. Int. J. Pattern Recognit. Artif. Intell. 30(1650004), 1–20 (2016)

    MathSciNet  Google Scholar 

  10. Zhang, X., Liu, Y., Luo, B., Pan, L.: Computational power of tissue P systems for generating control languages. Inf. Sci. 278, 285–297 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mahalingam, K., Paul, P., Mäkinen, E.: On derivation languages of a class of splicing systems. Acta Cybern. (2017, Accepted)

  12. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg, pp. 1–3 (1997)

  13. 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)

Download references

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

  1. Department of Computer Science and Engineering, Saveetha University, Chennai, 602105, India

    Williams Sureshkumar

  2. Department of Mathematics, Indian Institute of Technology Madras, Chennai, 600036, India

    Kalpana Mahalingam & Raghavan Rama

Authors
  1. Williams Sureshkumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kalpana Mahalingam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raghavan Rama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kalpana Mahalingam.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42044-018-0010-9

Keywords

Search

Navigation