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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU76814" target="_blank" >RIV/00216305:26230/09:PU76814 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language description

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 itis 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.<br>

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BD - Information theory

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

International Journal of Foundations of Computer Science

ISSN

0129-0541

e-ISSN

—

Volume of the periodical

20

Issue of the periodical within the volume

2

Country of publishing house

SG - SINGAPORE

Number of pages

10

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—