Affiliation:
1. Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno 61266, Czech Republic
Abstract
This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the generative power and that these systems are computationally complete. Without erasing productions, however, these systems are less powerful than context-sensitive grammars.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Concluding Remarks;Modern Language Models and Computation;2017
2. Chapter 21 Concluding Remarks;Regulated Grammars and Automata;2014
3. On the power of permitting features in cooperating context-free array grammar systems;Discrete Applied Mathematics;2013-10
4. Generalized one-sided forbidding grammars;International Journal of Computer Mathematics;2013-02
5. One-sided forbidding grammars and selective substitution grammars;International Journal of Computer Mathematics;2012-03