Chain code P system generating a variant of the Peano space-filling curve
From MaRDI portal
Publication:2328320
DOI10.1007/978-3-030-12797-8_6OpenAlexW2913295858MaRDI QIDQ2328320FDOQ2328320
Authors: Rodica Ceterchi, Atulya K. Nagar, K. G. Subramanian 
Publication date: 10 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-12797-8_6
Recommendations
- P systems with parallel rewriting for chain code picture languages
- Approximating polygons for space-filling curves generated with P systems
- Chain code P system for generation of approximation patterns of Sierpiński curve
- Generating pictures in string representation with P systems: the case of space-filling curves
- scientific article; zbMATH DE number 2245558
Cited In (6)
- Generating pictures in string representation with P systems: the case of space-filling curves
- P systems with parallel rewriting for chain code picture languages
- Chain code P system for generation of approximation patterns of Sierpiński curve
- Hilbert words as arrays generated with P systems
- Approximating polygons for space-filling curves generated with P systems
- Title not available (Why is that?)
This page was built for publication: Chain code P system generating a variant of the Peano space-filling curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328320)
