One-Sided Random Context Grammars with Leftmost Derivations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU101747" target="_blank" >RIV/00216305:26230/12:PU101747 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.springerlink.com/content/mx44705255227153/" target="_blank" >http://www.springerlink.com/content/mx44705255227153/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-31644-9_11" target="_blank" >10.1007/978-3-642-31644-9_11</a>

Jazyk výsledku

angličtina

Název v původním jazyce

One-Sided Random Context Grammars with Leftmost Derivations

Popis výsledku v původním jazyce

In this paper, we study the generative power of one-sided random context grammars working in a leftmost way. More specifically, by analogy with the three well-known types of leftmost derivations in regulated grammars, we introduce three types of leftmostderivations to one-sided random context grammars and prove the following three results. (I) One-sided random context grammars with type-1 leftmost derivations characterize the family of context-free languages. (II) One-sided random context grammars withtype-2 and type-3 leftmost derivations characterize the family of recursively enumerable languages. (III) Propagating one-sided random context grammars with type-2 and type-3 leftmost derivations characterize the family of context-sensitive languages. In the conclusion, the generative power of random context grammars and one-sided random context grammars with leftmost derivations is compared.

Název v anglickém jazyce

One-Sided Random Context Grammars with Leftmost Derivations

Popis výsledku anglicky

In this paper, we study the generative power of one-sided random context grammars working in a leftmost way. More specifically, by analogy with the three well-known types of leftmost derivations in regulated grammars, we introduce three types of leftmostderivations to one-sided random context grammars and prove the following three results. (I) One-sided random context grammars with type-1 leftmost derivations characterize the family of context-free languages. (II) One-sided random context grammars withtype-2 and type-3 leftmost derivations characterize the family of recursively enumerable languages. (III) Propagating one-sided random context grammars with type-2 and type-3 leftmost derivations characterize the family of context-sensitive languages. In the conclusion, the generative power of random context grammars and one-sided random context grammars with leftmost derivations is compared.

Druh

C - Kapitola v odborné knize

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

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

Rok uplatnění

2012

Kód důvěrnosti údajů

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

Název knihy nebo sborníku

LNCS Festschrift Series: Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday

ISBN

978-3-642-31643-2

Počet stran výsledku

14

Strana od-do

160-173

Počet stran knihy

292

Název nakladatele

Springer Verlag

Místo vydání

Berlin-Heidelberg

Kód UT WoS kapitoly

—