We prove that grammar systems with (prescribed or free) teams (of constant size at least two or arbitrary size) working as long as they can do, characterize the family of languages generated by (context-free) matrix grammars with appearance checking; in this way, the results in [Paun, Rozenberg 1994] are completed and improved
The investigation on Boolean operations on the stop conditions of derivation modes for cooperating d...
Parallel communicating grammar systems consist of several grammars and perform derivation steps, whe...
Abstract. We study the generative power of CD grammar systems (CDGSs) that use a cooperation protoco...
Abs t r ac t. In this paper, we introduce a dynamical complexity measure, namely the degree of team ...
The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weake...
summary:Multigenerative grammar systems are based on cooperating context-free grammatical components...
A generative grammar called equal matrix grammar which generates a class which meets both context-se...
AbstractA new dynamical measure of the descriptional complexity for context-free grammars and langua...
This article defines cooperating distributed grammar systems with E0L components instead of context-...
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if...
AbstractIn this paper, we investigate simple eco-grammar systems with n agents. The number of agents...
summary:In this paper we follow our previous research in the field of positioned agents in the eco-g...
A team of learning machines is a multiset of learning machines. A team is said to successfully ident...
AbstractA team of learning machines is a multiset of learning machines. A team is said to successful...
In this paper we extend the conditions of dynamic team constitution in simple eco– grammar systems, ...
The investigation on Boolean operations on the stop conditions of derivation modes for cooperating d...
Parallel communicating grammar systems consist of several grammars and perform derivation steps, whe...
Abstract. We study the generative power of CD grammar systems (CDGSs) that use a cooperation protoco...
Abs t r ac t. In this paper, we introduce a dynamical complexity measure, namely the degree of team ...
The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weake...
summary:Multigenerative grammar systems are based on cooperating context-free grammatical components...
A generative grammar called equal matrix grammar which generates a class which meets both context-se...
AbstractA new dynamical measure of the descriptional complexity for context-free grammars and langua...
This article defines cooperating distributed grammar systems with E0L components instead of context-...
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if...
AbstractIn this paper, we investigate simple eco-grammar systems with n agents. The number of agents...
summary:In this paper we follow our previous research in the field of positioned agents in the eco-g...
A team of learning machines is a multiset of learning machines. A team is said to successfully ident...
AbstractA team of learning machines is a multiset of learning machines. A team is said to successful...
In this paper we extend the conditions of dynamic team constitution in simple eco– grammar systems, ...
The investigation on Boolean operations on the stop conditions of derivation modes for cooperating d...
Parallel communicating grammar systems consist of several grammars and perform derivation steps, whe...
Abstract. We study the generative power of CD grammar systems (CDGSs) that use a cooperation protoco...
DOI
Add to ORKG