Chain code P system generating a variant of the Peano space-filling curve

DOI10.1007/978-3-030-12797-8_6MaRDI QIDQ2328320zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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
• scientific article; zbMATH DE number 2245558 (Why is no real title available?)
• P systems with parallel rewriting for chain code picture languages
• Hilbert words as arrays generated with P systems
• Chain code P system for generation of approximation patterns of Sierpiński curve
• Approximating polygons for space-filling curves generated with P systems

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)