Skip to main content
SpringerLink
Log in

Control words of string rewriting P systems

  • Published:
International Journal of Advances in Engineering Sciences and Applied Mathematics Aims and scope Submit manuscript

Abstract

P systems with controlled computations have been introduced and investigated in the recent past, by assigning labels to the rules in the regions of the P system and guiding the computations by control words. Here we consider string rewriting cell-like transition P system with label assigned rules working in acceptor mode and compare the obtained family of languages of control words over the rule labels with certain well-known language families. An application to chain code picture generation is also pointed out.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Pǎun, Gh: Computing with membranes. J. Comput. Syst. Sci. 61, 108–143 (2000)

    Article  MathSciNet  Google Scholar 

  2. Păun, Gh: Membrane Computing: An Introduction. Springer, Berlin, Heidelbrg (2000)

    MATH  Google Scholar 

  3. Păun, Gh, Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press Inc, New York (2010)

    Book  Google Scholar 

  4. Zhang, G., Pan, L.: A survey of membrane computing as a new branch of natural computing. Chin. J. Comput. 33(2), 208–214 (2010)

    Article  Google Scholar 

  5. Pǎun, Gh, Pérez Jiménez, M.J.: Languages and P systems: recent developments. Comput. Sci. J. Maldova 20, 112–132 (2012)

    MathSciNet  MATH  Google Scholar 

  6. Krithivasan, K., Păun, Gh, Ramanujan, A.: On controlled P systems. Fundam. Inf. 131(3–4), 451–464 (2014)

    MathSciNet  MATH  Google Scholar 

  7. Chen, H., Freund, R., Ionescu, M., Păun, G., Pérez-Jiménez, M.J.: On string languages generated by spiking neural P systems. Fundam. Inf. 75(1–4), 141–162 (2007)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  9. Martín-Vide, C., Păun, Gh, Pazos, J., Rodrguez Patón, A.: Tissue P systems. Theor. Comput. Sci. 296(2), 295–326 (2003)

    Article  MathSciNet  Google Scholar 

  10. Ramanujan, A., Krithivasan, K.: Control languages associated with tissue P systems. In: Proceedings of Twelfth International Conference on Unconventional Computation and Natural Computation 2013. Lecture Notes in Computer Science, vol. 7956, pp. 186–197 (2013)

    Chapter  Google Scholar 

  11. Ramanujan, A.: Control languages in P systems. Ph.D Thesis, Indian Institute of Technology Madras (2014)

  12. Besozzi, D., Mauri, G., Zandron, C.: Hierarchies of parallel rewriting P systems—a survey. New Gener. Comput. 22(4), 331–347 (2004)

    Article  Google Scholar 

  13. Besozzi, D., Ferretti, C., Mauri, G., Zandron, C.: Parallel rewriting P systems with deadlock. Lect. Notes Comput. Sci. 2568, 302–314 (2003)

    Article  Google Scholar 

  14. Bottoni, P., Labella, A., Martin-Vide, C., Păun, Gh: Rewriting P systems with conditional communication. Lect. Notes Comput. Sci. 2300, 325–353 (2002)

    Article  MathSciNet  Google Scholar 

  15. Ferretti, C., Mauri, G., Păun, Gh, Zandron, C.: On three variants of rewriting P systems. Theor. Comput. Sci. 301, 201–215 (2003)

    Article  MathSciNet  Google Scholar 

  16. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)

    MATH  Google Scholar 

  17. Sureshkumar, W., Rama, R.: Regulating a distributed computing model via Chomsky hierarchy. GSTF J. Math. Stat. Oper. Res. 3(1), 21–29 (2015)

    Google Scholar 

  18. Ibarra, O.H.: Simple matrix languages. Inf. Control 17, 359–394 (1970)

    Article  MathSciNet  Google Scholar 

  19. Fernau, H.: Even linear simple matrix languages: formal language properties and grammatical inference. Theor. Comput. Sci. 289, 425–456 (2002)

    Article  MathSciNet  Google Scholar 

  20. Rosebrugh, R.D., Wood, D.: Image theorems for simple matrix languages and \(n\)-parallel languages. Math. Syst. Theor. 8(2), 150–155 (1975)

    Article  MathSciNet  Google Scholar 

  21. Maurer, H.A., Rozenberg, G., Welzl, E.: Using string languages to describe picture languages. Inf. Control 54, 155–185 (1982)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank the reviewers for their very useful comments which helped in improving the presentation

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Faculty of Science, Liverpool Hope University, Hope Park, Liverpool, L16 9JD, UK

    Atulya K. Nagar & K. G. Subramanian

  2. Department of Computer Science and Engineering, College of Engineering, Thiruvananthapuram, Kerala, 695016, India

    Ajeesh Ramanujan

Authors
  1. Atulya K. Nagar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajeesh Ramanujan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. G. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. G. Subramanian.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nagar, A.K., Ramanujan, A. & Subramanian, K.G. Control words of string rewriting P systems. Int J Adv Eng Sci Appl Math 10, 230–235 (2018). https://doi.org/10.1007/s12572-018-0222-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12572-018-0222-0

Keywords

Search

Navigation