# 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={Rudolf Freund and Sergiu Ivanov and Marion Oswald and K. G. Subramanian}, booktitle={MCU}, year={2013} }

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…

## 3 Citations

Array Insertion and Deletion P Systems

- Computer ScienceUCNC
- 2013

It is shown that two-dimensional array insertion and deletion P systems can already obtain computational completeness using such P systems with a membrane structure of tree height of at most two and only the targets here, in, and out.

A General Framework for Sequential Grammars with Control Mechanisms

- Computer ScienceDCFS
- 2019

Many relations between the languages generated by sequential grammars working on these objects with different control mechanisms were shown to be similar to the relations already proved for the string case.

Control Mechanisms for Array Grammars on Cayley Grids

- EngineeringMCU
- 2018

Using \(\#\)-context-free array productions together with control mechanisms as control graphs, matrices, permitting and forbidden rules, partial order on rules or activation and blocking of rules the same computational power is obtained as when using arbitrary array productions.

## References

SHOWING 1-10 OF 38 REFERENCES

Array Insertion and Deletion P Systems

- Computer ScienceUCNC
- 2013

It is shown that two-dimensional array insertion and deletion P systems can already obtain computational completeness using such P systems with a membrane structure of tree height of at most two and only the targets here, in, and out.

Contextual array grammars and array P systems

- Computer ScienceAnnals of Mathematics and Artificial Intelligence
- 2013

There is a proper infinite hierarchy with respect to the classes of languages described by contextual array P systems, and such a hierarchy holds as well in the case when the selector is also endowed with the #−sensing ability.

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars

- Computer ScienceFundam. Informaticae
- 2005

The main result proved in this paper shows that the natural embedding of any recursively enumerable one-dimensional array language in the two-dimensional space can be characterized by the projection…

P Systems with Minimal Left and Right Insertion and Deletion

- MathematicsUCNC
- 2012

It is shown that using these operations in a P systems framework (which corresponds to using specific variants of graph control), computational completeness can even be achieved with the operations of left and right insertion and deletion of only one symbol.

Contextual Grammars: Parallelism and Blocking of Derivation

- Linguistics, Computer ScienceFundam. Informaticae
- 1996

This work considers contextual grammars with parallel derivations, in which the whole current string participates to a derivation step in the sense that it is splitted into substrings to which contexts are adjoined in a parallel manner.

On Representing RE Languages by One-Sided Internal Contextual Languages

- Computer Science, LinguisticsActa Cybern.
- 1996

In this paper we prove that each recursively enumerable language L can be written in the form L — cutd(L' fl R), where L' is a language generated by a one-sided internal contextual grammar witli…

Regulated Rewriting in Formal Language Theory

- Computer Science
- 1989

This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.

Insertion and iterated insertion as operations on formal languages

- Mathematics
- 1982

The operations of insertion ((<---)) and iterated insertion ((<---)*) are simple variants of Kleene's operations (.) and (,*) ({Kle 56}) in a manner similar to the operations shuffle and iterated…

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

- Computer ScienceICALP
- 1995

This book investigates two major systems, cooperating distributed grammar systems and parallel communicating grammar systems, which concerns hierarchies with respect to different variants of cooperation, relations with classical formal language theory, syntactic parameters such as the number of components and their size, power of synchronization, and general notions generated from artificial intelligence.