We define cooperating distributed grammar systems with start and stop conditions which are
based on the competence of a component on the current sentential form. We distinguish six …

A Szilard language is a language theoretical tool used to describe the derivation process in
a formal grammar or grammar system. We investigate computational resources used by …

It is well known that certain language families generated by cooperating distributed (CD)
grammar systems can be characterized in terms of context-free random context grammars. In …

We continue our investigation of the generative power of cooperating distributed grammar
systems (CDGSs), using the previously introduced≤ k-,= k-, and≥ k-competence-based …

Abstract Consider ET0L grammars. Modify them such that a set of permitting symbols and a
set of forbidding symbols are attached to each of their rules, just like in random context …

We introduce some new cooperation protocols for cooperating distributed (CD) grammar
systems. They depend on the number of different nonterminals present in the sentential form …

In this paper we examine context-free cooperating distributed (CD) grammar systems where
the cooperation protocol is based on the competence (capability) of the component …

In the fields of computer science, mathematics, statistics,(bio) physics, or in any other
science that requires mathematical approaches, complexity estimates the computational …

To live, work, and prosper on the Earth, people need to communicate, and they do so by
means of a broad variety of languages developed from the dawn of civilization up to today …

We study the generative power of CD grammar systems (CDGSs) that use a cooperation
protocol based on the level of competence on a sentential form—and the competence of …