Name
Abstract | ||
|---|---|---|
Construction of finite grammars to generate languages of digitized picture patterns, considered as arrays of symbols, has been a problem of interest in two-dimensional formal languages. On the other hand, in the area of membrane computing, P systems were developed for handling the problem of picture array generation, with the rewriting involved being sequential or parallel. We introduce in this paper the array representation for the Hilbert words, the finite approximations of the Hilbert space-filling curve, and we generate them with array-rewriting rules in P systems. The array rewriting is done in parallel, with the P system serving as a control mechanism. A main contribution is the proof of correctness which is done using a linearization procedure. In addition, the advantage of the P system used is that the number of membranes involved is small (only one or two). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s41965-021-00078-y | Journal of Membrane Computing |
Keywords | DocType | Volume |
Membrane computing, Parallel rewriting, Array grammars, Chain code words, Hilbert’s space-filling curve | Journal | 3 |
Issue | ISSN | Citations |
3 | 2523-8906 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rodica Ceterchi | 1 | 119 | 17.38 |
| Luping Zhang | 2 | 0 | 0.34 |
| K. G. Subramanian | 3 | 339 | 59.27 |
| Gexiang Zhang | 4 | 736 | 45.93 |