Formal languages
On cooperating/distributed grammar systems
Journal of Information Processing and Cybernetics
Cooperating/distributed grammar systems with hypothesis languages
Journal of Experimental & Theoretical Artificial Intelligence
Advances in the Dempster-Shafer theory of evidence
Matrix grammars versus parallel communicating grammar systems
Mathematical aspects of natural and formal languages
Nonreturning PC grammar systems can be simulated by returning systems
Theoretical Computer Science
Parallel, Distributed and Multiagent Production Systems
Parallel, Distributed and Multiagent Production Systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
CSCW and Artificial Intelligence
CSCW and Artificial Intelligence
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Computer-Aided Cooperative Product Development: Mit-JSME Workshop, Mit, Cambridge, U. S. A. November 20-21, 1989 Proceedings
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
On the Generative Capacity of Parallel Communicating Grammar Systems with Regular Components
On the Generative Capacity of Parallel Communicating Grammar Systems with Regular Components
Agents on stage: advancing the state of the art of AI
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Rough Set Approximations of Languages
Fundamenta Informaticae
Hi-index | 0.00 |
In a parallel communicating grammar system, several grammars work together, synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions formulated on the transmitted strings, and (2) conditions formulated on the resulting string in the receiving components. These conditions are expressed in terms of regular languages, whose elements the mentioned strings should be. Moreover, we allow that the communicated string is a part (any one, a prefix, a maximal, a minimal one, etc.) of the string of the communicating component. We investigate these variants from the point of view of the generative capacity of the corresponding parallel communicating grammar systems.