Publication Details
One-Sided Random Context Grammars with Leftmost Derivations
Zemek Petr, Ing., Ph.D.
formal languages, regulated rewriting, one-sided random context grammars, leftmost derivations, generative power
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 leftmost derivations 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 with type-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.
@inbook{BUT96922,
author="Alexandr {Meduna} and Petr {Zemek}",
title="One-Sided Random Context Grammars with Leftmost Derivations",
booktitle="LNCS Festschrift Series: Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday",
year="2012",
publisher="Springer Verlag",
address="Berlin-Heidelberg",
pages="160--173",
doi="10.1007/978-3-642-31644-9\{_}11",
isbn="978-3-642-31643-2",
url="https://www.scopus.com/record/display.uri?eid=2-s2.0-84867018824&origin=resultslist"
}