Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components

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

Result language
angličtina
Original language name
Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components
Original language description
This article deals with cooperative distributed grammar systems and cooperative distributed grammar systems controlled by graph with infinite number of components. Proofs of generative power for both types of grammar systems are provided. Both grammar systems are capable of generating arbitrary language, thus recursively enumerable languages. Graph controlled grammar systems with context-free productions, respectively with regular productions are more powerful than unrestricted grammars. Results are compared to grammar systems with finite number of components.
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
2009
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 15th Conference and Competition STUDENT EEICT 2009 Volume 4
ISBN
978-80-214-3870-5
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Department of Information Systems FIT BUT
Place of publication
Brno
Event location
FEKT VUT v Brně
Event date
Apr 23, 2009
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)