On Distributed Cooperation and Synchronised Collaboration

In CD grammar systems, the rewriting process is distributed over component grammars that take turns in the derivation of new symbols. Team automata however collaborate by synchronising their actions. Here we investigate how to transfer this concept of synchronisation to grammars by defining grammar teams that agree on the generation of shared terminal symbols based on a novel notion of competence. We first illustrate this idea for the case of regular grammars and next propose an extension to the case of context-free grammars.

[1]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.

[2]  Erzsébet Csuhaj-Varjú,et al.  Team Behaviour in Eco-Grammar Systems , 1998, Theor. Comput. Sci..

[3]  Victor Mitrana,et al.  Teams of pushdown automata , 2004, Int. J. Comput. Math..

[4]  Erzsébet Csuhaj-Varjú,et al.  On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra , 2006, Fundam. Informaticae.

[5]  Erzsébet Csuhaj-Varjú,et al.  On Cooperating/Distributed Grammar Systems , 1990, J. Inf. Process. Cybern..

[6]  Gheorghe Paun,et al.  Teams in cooperating grammar systems , 1995, J. Exp. Theor. Artif. Intell..

[7]  Erzsébet Csuhaj-Varjú,et al.  On Competence in CD Grammar Systems , 2004, Developments in Language Theory.

[8]  NiiPenny.  The blackboard model of problem solving , 1986 .

[9]  Erzsébet Csuhaj-Varjú,et al.  Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems , 2007, Fundam. Informaticae.

[10]  Maurice H. ter Beek,et al.  Teams in Grammar Systems: Hybridity and Weak Rewriting , 1996, Acta Cybern..

[11]  Fabio Gadducci,et al.  A Calculus for Team Automata , 2008, Electron. Notes Theor. Comput. Sci..

[12]  Maurice H. ter Beek,et al.  Team Automata: A Formal Approach to the Modeling of Collaboration Between System Components , 2003 .

[13]  Maurice H. ter Beek,et al.  Team Automata Satisfying Compositionality , 2003, FME.

[14]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[15]  Maurice H. ter Beek,et al.  Teams in Grammar Systems: Sub-Context-Free Cases , 1997, New Trends in Formal Languages.

[16]  Kamala Krithivasan,et al.  Distributed Processing in Automata , 1999, Int. J. Found. Comput. Sci..

[17]  Maurice H. ter Beek,et al.  Petri Net Control for Grammar Systems , 2002, Formal and Natural Computing.

[18]  Erzsébet Csuhaj-Varjú,et al.  Peer-to-Peer Networks: A Language Theoretic Approach , 2008, Comput. Informatics.

[19]  Grzegorz Rozenberg,et al.  Synchronizations in Team Automata for Groupware Systems , 2003, Computer Supported Cooperative Work (CSCW).

[20]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[21]  Erzsébet Csuhaj-Varjú,et al.  Eco-grammar systems: a grammatical framework for studying lifelike interactions , 1997 .

[22]  Victor Mitrana,et al.  Teams of Pushdown Automata , 2003, Ershov Memorial Conference.

[23]  Maurice H. ter Beek,et al.  Vector team automata , 2012, Theor. Comput. Sci..

[24]  Victor Mitrana,et al.  Distributed Pushdown Automata Systems: Computational Power , 2003, Developments in Language Theory.