Generating pictures in string representation with P systems: the case of space-filling curves
From MaRDI portal
Publication:1982992
DOI10.1007/s41965-020-00061-zzbMath1469.68028OpenAlexW3099837486MaRDI QIDQ1982992
K. G. Subramanian, Rodica Ceterchi
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-020-00061-z
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Grammars and rewriting systems (68Q42) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (4)
Hilbert words as arrays generated with P systems ⋮ Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems ⋮ Division rules for tissue P systems inspired by space filling curves ⋮ Parallel contextual array insertion deletion P systems and tabled matrix grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space-filling curves
- Array-rewriting P systems
- Computing with membranes
- Approximating polygons for space-filling curves generated with \(\mathrm{P}\) systems
- Membrane computing. An introduction.
- How derivation modes and halting conditions may influence the computational power of P systems
- Chain code P system generating a variant of the Peano space-filling curve
- Über Peano-Kurven
- Space-Filling Curves
- P Systems with Parallel Rewriting for Chain Code Picture Languages
- Using string languages to describe picture languages
- Chain-code pictures and collages generated by hyperedge replacement
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- Chain code P system for generation of approximation patterns of Sierpiński curve
This page was built for publication: Generating pictures in string representation with P systems: the case of space-filling curves
