Motivated by systems of artificial intelligence with distributed knowledge bases, we introduce the concept of a cooperating/distributing grammar system. In this paper, we study the effect of different conditions for starting and stopping of the components of the grammar system. If the start condition is of random context type, we obtain at most all matrix languages; if conditional or semiconditional start conditions are used, we get the family of context-sensitive languages. Time limitations have no further effect in these cases.
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence