论文信息 - Grammar Systems with Counting Derivation and Dynamical Priorities

Grammar Systems with Counting Derivation and Dynamical Priorities

The paper deals with a new type of restriction considered for the cooperation protocol of grammar systems. The effect of this strategy is investigated for all modes of derivation. Some connections are made with the usual concept of fairness [1], [6] and that introduced for grammar systems [5].

[1] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

[2] H. P Nii,et al. Blackboard Systems , 1986 .

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

[4] Victor Mitrana,et al. Fairness in Grammar Systems , 1996, Acta Cybern..

[5] Gheorghe Paun,et al. Grammar Systems , 1997, Handbook of Formal Languages.

[6] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.

[7] Jürgen Dassow,et al. Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence , 1991, Bull. EATCS.

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

[9] David Hemmendinger. Specifying Ada Server Tasks with Executable Formal Grammars , 1990, IEEE Trans. Software Eng..

[10] Robert Meersman,et al. Cooperating Grammar Systems , 1978, MFCS.