Book ChapterDOI
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III
Martin Vu,Henning Fernau +1 more
- pp 577-592
Reads0
Chats0
TLDR
In this paper, substitutions are added to matrix insertion-deletion systems, and the effect of appearance checking is discussed, and new characterizations of the families of context sensitive and recursively enumerable languages are obtained.Abstract:
We discuss substitutions as a further type of operations, added to matrix insertion-deletion systems. For such systems, we additionally discuss the effect of appearance checking. This way, we obtain new characterizations of the families of context-sensitive and the family of recursively enumerable languages. To reach computational completeness, not much context is needed for systems with appearance checking.read more
Citations
More filters
Journal ArticleDOI
On the generative capacity of matrix insertion-deletion systems of small sum-norm
TL;DR: It is shown that if a matrix ins-del system of size s can describe the class of linear languages $$\mathrm {LIN}$$ LIN , then without any additional resources, matrixins-del systems of size s also describe the regular closure of LIN.
Journal ArticleDOI
Insertion-deletion systems with substitutions I
Martin Vu,Henning Fernau +1 more
TL;DR: The authors add substitutions as a further type of operations to insertion-deletion systems and obtain new characterizations of and normal forms for context-sensitive and recursively enumerable languages.
References
More filters
Book
Regulated rewriting in formal language theory
Jrgen Dassow,Gheorghe Paun +1 more
TL;DR: 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.
Journal ArticleDOI
DNA computing: Arrival of biological mathematics
TL;DR: The relationship between mathematics and biology has so far been one-way: a mathematical problem is the end toward which the tools of biology are used as discussed by the authors, which marks the first instance of the connection being reversed, and instead of categorizing the research in DNA computing as belonging to mathematical biology, we should be employing the mirror image term biological mathematics for the field born in November 1994.
Journal ArticleDOI
Petri net algorithms in the theory of matrix grammars
Dirk Hauschildt,Matthias Jantzen +1 more
TL;DR: It is shown that the languages over a one-letter alphabet generated by context-free matrix grammars are always regular and a decision procedure is given for the question of whether a context- free matrix language is finite.
Journal ArticleDOI
Some questions of phrase structure grammars, i
TL;DR: The (associative and non-commutative) operation of CONCATENATION (denoted by ""*) is defined on V, where V is a finite set of symbols (LETTERS) called DICTIONARY, and Vt is a (proper) subset of V called TERMINAL DICTionARY.
Journal ArticleDOI
Computing with DNA.
TL;DR: This work considers molecular models for computing and derives a DNA-based mechanism for solving intractable problems through massive parallelism, and suggests that such methods might reduce the effort needed to solve otherwise difficult tasks.
Related Papers (5)
On Languages Generated by Context-Free Matrix Insertion-Deletion Systems with Exo-Operations
Bosheng Song,Fei Xu,Linqiang Pan +2 more