PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Ter Beek M. H., Csuhaj-Varju E., Holzer M., Vaszil G. On Competence in CD Grammar Systems. In: DLT'04 - International Conference on Developments in Language Theory (Auckland, New Zealand, 13 - 17 December 2004). Proceedings, pp. 76 - 88. C.S. Calude, E. Calude, and M.J. Dinneen (eds.). (Lecture Notes in Computer Science, vol. 3340). Springer-Verlag, Berlin, 2004.
 
 
Abstract
(English)
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.
URL: http://www.springerlink.com/link.asp?id=p0d6t3rv9fmc1wx5
Subject Cooperating distributed grammar systems
Cooperation protocols
Competence
Regulated rewriting
F.4.2 Grammars and Other Rewriting Systems. Grammar types
F.4.3 Formal Languages. Classes defined by grammars or automata


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional