Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:1309.1268v1 (cs)
[Submitted on 5 Sep 2013]

Title:One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules

Authors:Rudolf Freund (TU Wien), Sergiu Ivanov, Marion Oswald (TU Wien), K.G. Subramanian
View PDF
Abstract:We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for P systems with (one-dimensional) insertion rules is undecidable. Then we show computational completeness of P systems using (one-dimensional) array insertion and deletion rules even of norm one only. The main result of the paper exhibits computational completeness of one-dimensional array grammars using array insertion and deletion rules of norm at most two.
Comments: In Proceedings MCU 2013, arXiv:1309.1043
Subjects: Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:1309.1268 [cs.FL]
  (or arXiv:1309.1268v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.1309.1268
Journal reference: EPTCS 128, 2013, pp. 62-75
Related DOI: https://doi.org/10.4204/EPTCS.128.14

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Thu, 5 Sep 2013 08:07:24 UTC (32 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2013-09
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)