Skip to main content
SpringerLink
Log in

P Systems with Parallel Rewriting for Chain Code Picture Languages

  • Conference paper
  • First Online:
Evolving Computability (CiE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9136))

Included in the following conference series:

Abstract

Chain code pictures are composed of unit lines in the plane, drawn according to a sequence of instructions left, right, up, down codified by words over \(\varSigma = \{ {l}, r, u, d \}\). P systems to generate such languages have been considered in previous work with sequential rewriting in the membranes. We consider here parallel rewriting, with the advantage of reducing the number of membranes. We also consider the problem of generating the finite approximations of space-filling curves, the Hilbert curve and the Peano curve.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ceterchi, R., Mutyam, M., Pǎun, G., Subramanian, K.G.: Array - rewriting P systems. Nat. Comput. 2, 229–249 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dassow, J., Habel, A., Taubenberger, S.: Chain-code pictures and collages generated by hyperedge replacement. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 412–427. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  3. Drewes, F.: Some remarks on the generative power of collage grammars and chain-code grammars. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 1–14. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Fernau, H., Freund, R., Schmid, M.L., Subramanian, K.G., Wiederhold, P.: Contextual array grammars and array P systems. Ann. Math. Artificial Intell. doi:10.1007/s10472-013-9388-0

  5. Ferretti, C., Mauri, G., Paun, G., Zandron, C.: On three variants of rewriting P systems. Theor. Comp. Sci. 301, 201–215 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Habel, A., Kreowski, H.J.: Collage grammars. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 411–429. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  7. Kitaev, S., Mansour, T., Seebold, P.: The Peano curve and counting occurrences of some patterns. J. Autom. Lang. Combin. 9(4), 439–455 (2004)

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Pan, L., Păun, G.: On parallel array P systems. In: Adamatzky, A. (ed.) Automata, Universality, Computation. ECC, vol. 12, pp. 173–183. Springer, Heidelberg (2015)

    Google Scholar 

  10. Pǎun, G.: Computing with membranes. J. Comp. Syst. Sci. 61, 108–143 (2000)

    Article  Google Scholar 

  11. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

  12. Seebold, P.: Tag system for the Hilbert curve. Discrete Math. Theor. Comp. Sci. 9, 213226 (2007)

    MathSciNet  Google Scholar 

  13. Siromoney, R., Subramanian, K.G.: Space-filling curves and infinite graphs. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol. 153, pp. 380–391. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  14. Subramanian, K.G.: P systems and picture languages. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 99–109. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Subramanian, K.G., Isawasan, P., Venkat, I., Pan, L.: Parallel array-rewriting P systems. Rom. J. Inf. Sci. Tech. 17(1), 103–116 (2014)

    Google Scholar 

  16. Subramanian, K.G., Venkat, I., Pan, L.: P Systems generating Chain Code Picture Languages, Proceedings of Asian Conference on Membrane Computing, pp. 115–123 (2012)

    Google Scholar 

Download references

Acknowledgments

The third author acknowledges partial support for this research from a RU grant, USM and an FRGS grant from MOHE, Malaysia.

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Bucharest, 14 Academiei Street, 010014, Bucharest, Romania

    Rodica Ceterchi

  2. Faculty of Science, Liverpool Hope University, Hope Park, Liverpool, L16 9JD, UK

    K. G. Subramanian

  3. School of Computer Sciences, Universiti Sains Malaysia, 11800, Penang, Malaysia

    Ibrahim Venkat

Authors
  1. Rodica Ceterchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. G. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ibrahim Venkat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rodica Ceterchi .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. University of Bucharest, Bucharest, Romania

    Victor Mitrana

  3. Sofia University, Sofia, Bulgaria

    Mariya Soskova

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ceterchi, R., Subramanian, K.G., Venkat, I. (2015). P Systems with Parallel Rewriting for Chain Code Picture Languages. In: Beckmann, A., Mitrana, V., Soskova, M. (eds) Evolving Computability. CiE 2015. Lecture Notes in Computer Science(), vol 9136. Springer, Cham. https://doi.org/10.1007/978-3-319-20028-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20028-6_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20027-9

  • Online ISBN: 978-3-319-20028-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation