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

@inproceedings{Freund2013OnedimensionalAG,
  title={One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules},
  author={R. Freund and S. Ivanov and M. Oswald and K. Subramanian},
  booktitle={MCU},
  year={2013}
}
  • R. Freund, S. Ivanov, +1 author K. Subramanian
  • Published in MCU 2013
  • Computer Science
  • 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… CONTINUE READING

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 39 REFERENCES
    Contextual array grammars and array P systems
    • 15
    • PDF
    Representations of Recursively Enumerable Array Languages by Contextual Array Grammars
    • 7
    A chomsky hierarchy of isotonic array grammars and languages
    • 63
    Regulated Rewriting in Formal Language Theory
    • 811
    P Systems with Minimal Left and Right Insertion and Deletion
    • 5
    • PDF
    Contextual Grammars: Parallelism and Blocking of Derivation
    • 17
    Marcus Contextual Grammars
    • G. Paun
    • Mathematics, Computer Science
    • 1994
    • 169
    Insertion and iterated insertion as operations on formal languages
    • 24