Abstract
We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be = k-competent (≤ k-, ≥ k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.
The first author was supported by an ERCIM postdoctoral fellowship and the third author was supported by project Centre of Excellence in Information Technology, Computer Science and Control, ICA1-CT-2000-70025, HUN-TING project, WP 5.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bordihn, H., Csuhaj-Varjú, E.: On competence and completeness in CD grammar systems. Acta Cybernetica 12(4), 347–361 (1996)
Bordihn, H., Holzer, M.: Grammar systems with negated conditions in their cooperation protocols. In: JUCS, vol. 6, pp. 1165–1184 (2000)
Csuhaj-Varj´u, E., Dassow, J.: On cooperating distributed grammar systems. In: EIK, vol. 26, pp. 49–63 (1990)
Csuhaj-Varjú, E., Dassow, J., Holzer, M.: On a Competence-based Cooperation Strategy in CD Grammar Systems. Technical Report 2004/3, Theoretical Computer Science Research Group, Computer and Automation Research Institute, Hungarian Academy of Sciences (2004)
Csuhaj-Varjú, E., Dassow, J., Holzer, M.: CD Grammar Systems with Competence Based Entry Conditions in Their Cooperation Protocols. Technical Report 2004/4, Theoretical Computer Science Research Group, Computer and Automation Research Institute, Hungarian Academy of Sciences (2004)
Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, Gh.: Grammar Systems— A Grammatical Approach to Distribution and Cooperation. Gordon and Breach (1994)
Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. In: EATCS Monographs on Theoretical Computer Science, vol. 18, Springer-Verlag, Berlin (1989)
Fernau, H., Wätjen, D.: Remarks on regulated limited ET0L systems and regulated context-free grammars. In: TCS, vol. 194, pp. 35–55 (1998)
Meersman, R., Rozenberg, G.: Cooperating grammar systems. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, Springer, Heidelberg (1978)
Păun, Gh., Rozenberg, G.: Prescribed teams of grammars. Acta Informatica 31, 525–537 (1994)
von Solms, S.H.: Some notes on ET0L-languages. In: IJCM, vol. 5, pp. 285–296 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ter Beek, M.H., Csuhaj-Varjú, E., Holzer, M., Vaszil, G. (2004). On Competence in CD Grammar Systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)