One-Sided Random Context Grammars: A Survey

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111929" target="_blank" >RIV/00216305:26230/14:PU111929 - isvavai.cz</a>

Result on the web

<a href="https://www.scopus.com/record/display.uri?eid=2-s2.0-84916899681&origin=resultslist" target="_blank" >https://www.scopus.com/record/display.uri?eid=2-s2.0-84916899681&origin=resultslist</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-13350-8_25" target="_blank" >10.1007/978-3-319-13350-8_25</a>

Result language

angličtina

Original language name

One-Sided Random Context Grammars: A Survey

Original language description

Recall that the notion of a one-sided random context grammar is based upon a finite set of context-free rules, each of which may be extended by finitely many permitting and forbidding nonterminal symbols. The set of all these rules is divided into two sets - the set of left random context rules and the set of right random context rules. When applying a left random context rule, the grammar checks the existence and absence of its permitting and forbidding symbols, respectively, in the prefix to the left of the rewritten nonterminal. Analogically, when applying a right random context rule, it checks the existence and absence of its permitting and forbidding symbols, respectively, only in the suffix to the right of the rewritten nonterminal. This paper gives a survey of the established results concerning one-sided random context grammars. These results concern their generative power, normal forms, size reduction, and conceptual modifications, which represent both restricted and generalized versions of their standard concepts. Perhaps most importantly and surprisingly, the paper points out that propagating versions of one-sided random context grammars characterize the family of context-sensitive languages, and with erasing rules, they characterize the family of recursively enumerable languages; as a result, they are stronger than ordinary random context grammars. Many open problem areas are suggested.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2014

Confidentiality

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

Book/collection name

Computing with New Resources

ISBN

978-3-319-13349-2

Number of pages of the result

14

Pages from-to

338-351

Number of pages of the book

473

Publisher name

Springer Verlag

Place of publication

Berlin

UT code for WoS chapter

—