Result Details
Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components
This paper deals with cooperative distributed grammar systems and their generative capacity, if the cooperative distributed grammar system has infinite number of components, context-free or regular.
cooperative distributed grammar systems, infinite number of components, context-free grammars, regular grammars, generative capacity
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.
@inproceedings{BUT33425,
author="Filip {Goldefus}",
title="Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components",
booktitle="Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4",
year="2009",
series="4",
pages="400--4004",
publisher="Department of Information Systems FIT BUT",
address="Brno",
isbn="978-80-214-3870-5"
}