Journal ArticleDOI
Accepting grammars with regulation
Henning Bordihn,Henning Fernau +1 more
Reads0
Chats0
TLDR
This paper investigates the classical regulated rewriting mechanisms like programmed grammars, matrix Grammars and ordered grammARS considered as accepting devices, in contrast with the usual generating mode, and obtains that ordered gramMars with context-free rules, admitting γ-productions, are computationally universal in accepting mode.Abstract:
In this paper, we investigate the classical regulated rewriting mechanisms like programmed grammars, matrix grammars and ordered grammars considered as accepting devices, in contrast with the usual generating mode. Where in the type-n grammars of the Chomsky hierarchy the descriptive power both of generating and of accepting grammars coincide, this need not be true any more in regulated devices. We even obtain, e.g., that ordered grammars with context-free rules and γ-free productions accept all context- sensitive γ-free languages, and that ordered grammars with context-free rules, admitting γ-productions, are computationally universal in accepting mode.read more
Citations
More filters
Book ChapterDOI
Grammars with controlled derivations
TL;DR: It is shown that “all” natural languages contain constructions which cannot be described by context-free grammars, and three basic such features of natural languages are: reduplication, multiple agreements, and crossed agreements.
Book
Regulated Grammars and Automata
Alexander Meduna,Petr Zemek +1 more
TL;DR: This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata, the most important language-defining devices that work under controls represented by additional mathematical mechanisms.
Journal ArticleDOI
Nonterminal Complexity of Programmed Grammars
TL;DR: It is shown that, in the case of context-free programmed grammars with appearance checking working under free derivations, three nonterminals are enough to generate every recursively enumerable language.
Journal Article
Membership for 1-Limited ET0L Languages Is Not Decidable.
TL;DR: It is shown how to encode arbitrary enumerable set of numbers given by register machines within limited EPT0L systems and programmed grammars with unconditional transfer, which has various consequences, e.g. the existence of nonre-cursive sets generable by 1lET0l systems or by programmed Grammar with unconditionalTransfer.
Journal ArticleDOI
Remarks on regulated limited ET0L systems and regulated context-free grammars
Henning Fernau,Dietmor Wätjen +1 more
TL;DR: Relations to recurrent programmed languages introduced by von Solms are exhibited and some results on (regulated) propagating (uniformly) k -limited ETOL systems which were not solved in [2, 18, 21, 22].
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
Control sets on grammars
TL;DR: The paper concerns the nature of the setLc(G) of those words generated by leftmost derivations inG whose corresponding string of rewriting rules is an element ofC whenC andG are assumed to have special form.
Journal ArticleDOI
One-sided and two-sided context in formal grammars
TL;DR: A proof for the equivalence of context-sensitive and one-sided contextsensitive languages is given, which yields as a corollary the normal form A → BC, AB → AC, A → a for context- sensitive grammars.