Advertisement

Teams in grammar systems: Sub-context-free cases

  • Maurice H. ter Beek
2. Cooperating Distributed Grammar Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1218)

Abstract

The study of teams in grammar systems so far has evolved around teams being formed from a finite number of sets of context-free productions. Here, the generative power of teams in grammar systems consisting of regular, linear and metalinear sets of productions is investigated.

For these sub-context-free cases the forming of teams strictly increases the generative power of the underlying grammar systems in many cases.

Keywords

Constant Size Regular Language Derivation Step Linear Production Sentential Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. H. ter Beek, Teams in grammar systems, IR-96-32 (master's thesis), Leiden University, 1996.Google Scholar
  2. 2.
    M. H. ter Beek, Teams in grammar systems: hybridity and weak rewriting. To appear in Proceedings Workshop Grammar Systems: Recent Results and Perspectives, Budapest, 26–27 July 1996.Google Scholar
  3. 3.
    E. Csuhaj-Varjú and J. Dassow, On cooperating distributed grammar systems. J. Inf. Process. Cybern. EIK 26 (1990), 49–63.Google Scholar
  4. 4.
    E. Csuhaj-Varjú, J. Dassow, J. Kelemen and Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994.Google Scholar
  5. 5.
    E. Csuhaj-Varjú and J. Kelemen, Cooperating grammar systems: a syntactical framework for the blackboard model of problem solving. In Proc. AI and information-control systems of robots '89 (I. Plander, ed.), North-Holland Publ. Co., 1989, 121–127.Google Scholar
  6. 6.
    E. Csuhaj-Varjú and Gh. Păun, Limiting the size of teams in cooperating grammar systems. Bulletin EATCS 51 (1993), 198–202.Google Scholar
  7. 7.
    E. Csuhaj-Varjú, Eco-grammar systems: recent results and perspectives. In [18] (1995), 79–103.Google Scholar
  8. 8.
    J. Dassow, Cooperating grammar systems (definitions, basic results, open problems). In [18] (1995), 40–52.Google Scholar
  9. 9.
    J. Dassow and Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, 1989.Google Scholar
  10. 10.
    J. Dassow and Gh. Păun, Cooperating distributed grammar systems with regular components. Computers and AI (1992).Google Scholar
  11. 11.
    R. Freund and Gh. Păun, A variant of team cooperation in grammar systems. J. UCS 1, 2 (1995), 105–130.Google Scholar
  12. 12.
    O. H. Ibarra, Simple matrix languages. Inform. Control 17 (1970), 359–394.Google Scholar
  13. 13.
    L. Kari, A. Mateescu, Gh. Păun and A. Salomaa, Teams in cooperating grammar systems, J. Exper. Th. AI 7 (1995), 347–359.Google Scholar
  14. 14.
    O. Mayer, Some restricted devices for context-free languages. Inform. Control 20 (1972), 69–92.Google Scholar
  15. 15.
    V. Mitrana, Hybrid cooperating distributed grammar systems. Computers and AI 2 (1993), 83–88.Google Scholar
  16. 16.
    Gh. Păun, On eliminating the λ-rules from simple matrix grammars. Fundamenta Informaticae 4 (1981), 185–195.Google Scholar
  17. 17.
    Gh. Păun, Grammar systems: a grammatical approach to distribution and cooperation. In Automata, Languages and Programming; 22nd International Colloquium, ICALP'95, Szeged, Hungary, Lecture Notes in Computer Science 944 (1995), 429–443.Google Scholar
  18. 18.
    Gh. Păun, ed., Artificial Life: Grammatical Models, Black Sea Univ. Press, Bucharest, Romania, 1995.Google Scholar
  19. 19.
    Gh. Păun and G. Rozenberg, Prescribed teams of grammars. Acta Informatica 31 (1994), 525–537.Google Scholar
  20. 20.
    D. J. Rosenkrantz, Programmed grammars and classes of formal languages. J. ACM 16, 1 (1969), 107–131.Google Scholar
  21. 21.
    G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.Google Scholar
  22. 22.
    A. Salomaa, Formal Languages, Academic Press, New York, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Maurice H. ter Beek
    • 1
  1. 1.Department of Computer ScienceLeiden UniversityRA LeidenThe Netherlands

Personalised recommendations