On rule-number complexity of components of probabilistic cooperating distributed grammar systems

Authors:
K. Arthi;Kamala Krithivasan;Erzsébet Csuhaj-Varjú
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai - 600036, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai - 600036, India;Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111 Budapest, Hungary
Venue:
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Year:
2002

Citing 8
Cited 0

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
Grammar systems

Handbook of formal languages, vol. 2
Parallel communicating grammar systems with bounded resources: results, techniques, open problems

Journal of Automata, Languages and Combinatorics
On size complexity of context-free returning parallel communicating grammar systems

Where mathematics, computer science, linguistics and biology meet
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Parallel communicating grammar systems with bounded resources

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the Size of Components of Cooperating Grammar Systems

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we discuss a size property of Probabilistic Cooperating Distributed Grammar Systems, grammatical constructs designed for modelling distributed random processing. We show that, with respect to the number of productions of a component grammar as a complexity measure, these systems exhibit a language specification of low complexity.