Skip to main content
SpringerLink
Log in
Book cover

New Trends in Formal Languages pp 150–166Cite as

Grammar systems with counting derivation and dynamical priorities

  • 2. Cooperating Distributed Grammar Systems
  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1218))

Abstract

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].

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, E.-R. Olderog, Verification of sequential and concurrent programs, Springer-Verlag, 1991.

    Google Scholar 

  2. E. Csuhaj-Varju, J. Dassow, On cooperating distributed grammar systems. J. Inform. Process. Cybern. (EIK) 26 (1990) 49–63.

    Google Scholar 

  3. E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon & Breach, London, 1994.

    Google Scholar 

  4. J. Dassow, J. Kelemen, Cooperating distributed grammar systems: a link between formal languages and artificial intelligence. Bulletin of EATCS 45 (1991) 131–145.

    Google Scholar 

  5. J. Dassow, V. Mitrana, Fairness in Grammar Systems. Acta Cybernetica, submitted.

    Google Scholar 

  6. N. Francez, Fairness, Springer-Verlag, 1986.

    Google Scholar 

  7. H. Georgescu, Concurrent Programming. Theory and Practice (in Romanian). Editura Tehnică, 1996.

    Google Scholar 

  8. D. Hemmendinger, Specifying Acta Server Tasks with Executable Formal Grammars. IEEE Transactions on Software Engineering, 16 7, July 1990.

    Google Scholar 

  9. R. Meersman, G. Rozenberg, Cooperating grammar systems. In: Proc. MFCS 78, LNCS 64, Springer-Verlag, Berlin, 1978, 364–374.

    Google Scholar 

  10. P. H. Nii, Blackboard systems. In: The Handbook of AI, vol. 4 (Eds.: A. Barr, P. R. Cohen, E. A. Feigenbaum), Addison-Wesley, Reading, Mass., 1989.

    Google Scholar 

  11. G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    Google Scholar 

  12. A. Salomaa, Formal Languages. Academic Press, New York, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Tudor Bălănescu, Horia Georgescu & Marian Gheorghe

Authors
  1. Tudor Bălănescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Horia Georgescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marian Gheorghe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bălănescu, T., Georgescu, H., Gheorghe, M. (1997). Grammar systems with counting derivation and dynamical priorities. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62844-6

  • Online ISBN: 978-3-540-68703-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation