Journal ArticleDOI
A remark on the regulation of k 1et0l systems
Reads0
Chats0
TLDR
This comparison of k-limited and regulated ETOL systems considers regular control, which has not been considered by Watjen (1993), which is not included in this comparison.About:
This article is published in Information Processing Letters.The article was published on 1993-11-08. It has received 4 citations till now. The article focuses on the topics: Regulated rewriting & Chomsky hierarchy.read more
Citations
More filters
Journal ArticleDOI
Parallel Grammars: A Phenomenology
Henning Fernau,Henning Fernau +1 more
TL;DR: The aim of this paper is to give prospective PhD students in the area hints at where to start a promising research; and to supplement earlier reference lists on parallel grammars, trying to cover recent papers as well as ``older'' papers which were somehow neglected in other reviews.
Journal ArticleDOI
On regularly controlled a limited tol systems
TL;DR: This paper can demonstrate that for every k e IN, the family of random context regularly controlled /clTOL languages with appearance checking equals theFamily of recursively enumerable languages.
Journal ArticleDOI
SOME UNDECIDABILITY RESULTS CONCERNING k-LIMITED 0L SYSTEMS
Heike Spilker,Dietmar Wätjen +1 more
TL;DR: It is proved that it is undecidable whether the union of two k-limited 0L languages is such a language again and whether a klT0L language can be generated by a context-free grammar.
Journal ArticleDOI
Decidability results concerning k -limited ED0L systems
Dietmar Wätjen,Heike Spilker +1 more
TL;DR: It is proved that the finiteness, emptiness, and membership problem and some other problems are decidable for a subfamily, namely the family of deterministic k-limited ETOL systems.
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
TOL Schemes and Control Sets
TL;DR: When a regular start set L and a regular control set C are given, the set C (L) is an ETOL language, and it is shown that the set ∋(∑) of all possible homomorphisms from a given alphabet ∑ into itself cannot be a control set.
Journal ArticleDOI
Regulation of K-limited etol systems
TL;DR: In this paper, different regulation mechanisms imposed upon k-limited ETOL systems are considered and the generative power of the systems is increased while in case of k- limited TOL systems this is, at least partially, not true.