Publication detail

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

MASOPUST, T.

Original Title

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

English Title

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

Type

journal article in Web of Science

Language

en

Original 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.

English 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.

Keywords

Cooperating distributed grammar systems; terminating derivation mode; forbidding grammars; forbidding cooperating distributed grammar systems; generative power.

RIV year

2009

Released

02.01.2009

Publisher

NEUVEDEN

Location

NEUVEDEN

ISBN

0129-0541

Periodical

International Journal of Foundations of Computer Science

Year of study

20

Number

2

State

SG

Pages from

331

Pages to

340

Pages count

10

URL

Documents

BibTex


@article{BUT49471,
  author="Tomáš {Masopust}",
  title="On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components",
  annote="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.",
  address="NEUVEDEN",
  chapter="49471",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  journal="International Journal of Foundations of Computer Science",
  number="2",
  volume="20",
  year="2009",
  month="january",
  pages="331--340",
  publisher="NEUVEDEN",
  type="journal article in Web of Science"
}