Left-Forbidding Cooperating Distributed Grammar Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F08%3APU86459" target="_blank" >RIV/00216305:26230/08:PU86459 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Left-Forbidding Cooperating Distributed Grammar Systems
Original language description
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached set occurs to the left of the rewritten nonterminal in the sentential form. The present paper discusses left-forbidding cooperating distributed grammar systems that work in the terminating mode and have left-forbidding grammars as their components. It demonstrates that, with a single component, these systems generate the family of context-free languages, whereas, with two components, these systems generate the family of recursively enumerable languages.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F07%2F0005" target="_blank" >GA201/07/0005: Multi-information technologies: Theory, models, and methods</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Article name in the collection
Proceedings of the 14th Conference and Competition STUDENT EEICT 2008 Volume 4
ISBN
978-80-214-3617-6
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Faculty of Information Technology BUT
Place of publication
Brno
Event location
FEKT VUT v Brně
Event date
Apr 24, 2008
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)