Some Power-Decreasing Derivation Restrictions in Grammar Systems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F11%3APU95991" target="_blank" >RIV/00216305:26230/11:PU95991 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Some Power-Decreasing Derivation Restrictions in Grammar Systems

Original language description

The paper, places some left restrictions on derivations in CD grammar systems with phrase-structure grammars, controlled by regular languages. The first restriction requires that every production is always applied within the first k nonterminals in everysentential form, for some k=1,...,n. The second restriction says how many blocks of non-terminals can be in every sentential form. The third restriction extends the second restriction and says how many blocks of non-terminals with limited length can bein every sentential form. We demonstrate that under these restrictions, the grammar systems generate different families of languages.

Czech name

—

Czech description

—

Type

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

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2011

Confidentiality

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

Name of the periodical

Schedae Informaticae

ISSN

0860-0295

e-ISSN

—

Volume of the periodical

2010

Issue of the periodical within the volume

19

Country of publishing house

PL - POLAND

Number of pages

11

Pages from-to

23-34

UT code for WoS article

—

EID of the result in the Scopus database

—