Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952039 | Theoretical Computer Science | 2017 | 22 Pages |
Abstract
In this paper, we discuss the computational completeness of the families of GCID systems of size (k;1,iâ²,iâ³;1,jâ²,jâ³) with kâ{3,5} and for (nearly) all values of iâ²,iâ³jâ²,jâ³â{0,1}. All proofs are based on the simulation of type-0 grammars given in Special Geffert Normal Form (SGNF). The novelty in our proof presentation is that the context-free and the non-context-free rules of the given SGNF grammar are simulated by GCID systems of different sizes and finally we combine them by stitching and overlaying to characterize the recursive enumerable languages. This proof presentation greatly simplifies and unifies the proof of such characterization results. We also connect some of the obtained GCID simulations to the domain of insertion-deletion P systems.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman,