Skip to main content
SpringerLink
Log in
Book cover

International Conference on Membrane Computing

CMC 2018: Membrane Computing pp 73–83Cite as

Chain Code P System Generating a Variant of the Peano Space-Filling Curve

  • Conference paper
  • First Online:

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

Abstract

Generation of the finite approximations of the well-known Hilbert and Peano space-filling curves, represented as chain-code words has been studied in an earlier work. The generation was done with parallel chain code P systems with objects as chain code words and rewriting with context-free rules in parallel. Continuing this line of work, finite approximations of a variant of the Peano curve considered by Wunderlich are generated here with parallel chain code P system. We also generate approximating polygons corresponding to the Peano curve with parallel chain code P system.

K. G. Subramanian—Honorary Visiting Professor.

This is a preview of subscription content, 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

Learn about 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  MathSciNet  Google Scholar 

  2. Ceterchi, R., Nagar, A.K., Subramanian, K.G.: Approximating polygons for space-filling curves generated with P systems. In: Graciani, C., Riscos-Núñez, A., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Enjoying Natural Computing. LNCS, vol. 11270, pp. 57–65. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00265-7_5

    Chapter  Google Scholar 

  3. Ceterchi, R., Subramanian, K.G., Venkat, I.: P systems with parallel rewriting for chain code picture languages. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 145–155. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-20028-6_15

    Chapter  Google Scholar 

  4. Dassow, J., Habel, A., Taubenberger, S.: Chain-code pictures and collages generated by hyperedge replacement. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 412–427. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61228-9_102

    Chapter  MATH  Google Scholar 

  5. 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). https://doi.org/10.1007/978-3-540-46464-8_1

    Chapter  MATH  Google Scholar 

  6. Gheorghe, M., Pǎun, Gh., Pérez Jiménez, M.J., Rozenberg, G.: Research frontiers of membrane computing: open problems and research topics. Int. J. Found. Comput. Sci. 24(5), 547–624 (2013)

    Article  MathSciNet  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)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  11. Sagan, H.: Space-Filling Curves. Springer, New York (1994). https://doi.org/10.1007/978-1-4612-0871-6

    Book  MATH  Google Scholar 

  12. Seebold, P.: Tag system for the Hilbert curve. Discrete Math. Theor. Comput. Sci. 9, 213–226 (2007)

    MathSciNet  MATH  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). https://doi.org/10.1007/BFb0000120

    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). https://doi.org/10.1007/978-3-540-74593-8_9

    Chapter  Google Scholar 

  15. Subramanian, K.G., Venkat, I., Pan, L.: P systems generating chain code picture languages. In: Proceedings of Asian Conference on Membrane Computing, pp. 115–123 (2012)

    Google Scholar 

  16. Wunderlich, W.: Über Peano-Kurven. Elem. Math. 28, 1–10 (1973)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank the anonymous referees for their valuable suggestions and comments which greatly helped to improve the paper.

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

    Atulya K. Nagar & K. G. Subramanian

Authors
  1. Rodica Ceterchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atulya K. Nagar
    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 Rodica Ceterchi .

Editor information

Editors and Affiliations

  1. Friedrich Schiller University Jena, Jena, Germany

    Thomas Hinze

  2. Leiden Centre of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Center for Computer Science (TUCS), Turku, Finland

    Arto Salomaa

  4. Informatics, Systems and Communication, University of Milano-Bicocca, Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ceterchi, R., Nagar, A.K., Subramanian, K.G. (2019). Chain Code P System Generating a Variant of the Peano Space-Filling Curve. In: Hinze, T., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2018. Lecture Notes in Computer Science(), vol 11399. Springer, Cham. https://doi.org/10.1007/978-3-030-12797-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12797-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12796-1

  • Online ISBN: 978-3-030-12797-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation