Institut für Informatik und Computational Science
Refine
Year of publication
- 2010 (43) (remove)
Document Type
- Article (19)
- Doctoral Thesis (13)
- Monograph/Edited Volume (9)
- Conference Proceeding (2)
Is part of the Bibliography
- yes (43) (remove)
Keywords
- Business Process Models (1)
- Compliance (1)
- Constraint Solving (1)
- Deduction (1)
- Dienstkomposition (1)
- Dienstplattform (1)
- Enterprise Search (1)
- Exploration (1)
- Geschäftsprozessmodelle (1)
- Grammatikalische Inferenz (1)
- Graph-basiertes Ranking (1)
- High-Level Synthesis (1)
- Informationsextraktion (1)
- Logic Programming (1)
- Logics (1)
- Multiprocessor (1)
- Multiprozessor (1)
- Next Generation Network (1)
- Optimization (1)
- Parallel Programming (1)
- Parallele Datenverarbeitung (1)
- Parallelrechner (1)
- Planing (1)
- Policy Enforcement (1)
- Reconfigurable (1)
- Service Creation (1)
- Service Delivery Platform (1)
- Service convergence (1)
- Synthese (1)
- Telekommunikation (1)
- Temporal Logic (1)
- Temporallogik (1)
- Verletzung Auflösung (1)
- Verletzung Erklärung (1)
- Violation Explanation (1)
- Violation Resolution (1)
- enterprise search (1)
- grammar inference (1)
- graph-based ranking (1)
- information extraction (1)
- konvergente Dienste (1)
- multi core data processing (1)
- rekonfigurierbar (1)
In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.