On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components

Tomáš MasopustTomáš Masopust
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components


Tomáš Masopust
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components
International Journal of Foundations of Computer Science, 20(2):331-340, 2009
  • KurzfassungAbstract
    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.
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@article{M2009,
  author  = {Tom{\'{a}}{\v{s}} Masopust},
  title   = {On the Terminating Derivation Mode in Cooperating Distributed
             Grammar Systems with Forbidding Components},
  journal = {International Journal of Foundations of Computer Science},
  volume  = {20},
  number  = {2},
  year    = {2009},
  pages   = {331-340},
  doi     = {10.1142/S0129054109006589}
}