Advertisement

On unconditional transfer

  • Henning Fernau
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1113)

Abstract

In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed grammars, matrix grammars, grammars with regular control, grammars controlled by bicoloured digraphs, and periodically time-variant grammars, especially regarding their descriptive capacity.

Moreover, we sketch the relations to restricted parallel mechanisms like k-, uniformly k-, partition-, and function-limited ETOL systems, as well as (unordered) scattered context grammars.

In this way, we solve a number of open problems from the literature.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Ábrahám. Some questions of phrase-structure grammars. Comput. Linguistics, 4:61–70, 1965.Google Scholar
  2. 2.
    A. Atanasiu and V. Mitrana. The modular grammars. International Journal of Computer Mathematics, 30:101–122, 1989.Google Scholar
  3. 3.
    H. Bordihn and H. Fernau. Accepting grammars with regulation. International Journal of Computer Mathematics, 53:1–18, 1994.Google Scholar
  4. 4.
    H. Bordihn and H. Fernau. Accepting grammars and systems via context condition grammars. Journal of Automata, Languages and Combinatorics, 1(2), 1996.Google Scholar
  5. 5.
    E. Csuhaj-Varjú et al. Grammar Systems: A Grammatical Approach to Distribution and Cooperation. London: Gordon and Breach, 1994.Google Scholar
  6. 6.
    J. Dassow. A remark on limited 0L systems. J. Inf. Process. Cybern. EIK, 24(6):287–291, 1988.Google Scholar
  7. 7.
    J. Dassow and Gh. Paun. Regulated Rewriting in Formal Language Theory. Berlin: Springer, 1989.Google Scholar
  8. 8.
    H. Fernau. On function-limited Lindenmayer systems. J. Inf. Process. Cybern. EIK, 27(1):21–53, 1991.Google Scholar
  9. 9.
    H. Fernau. Membership for 1-limited ET0L languages is not decidable. J. Inf. Process. Cybern. EIK, 30(4):191–211, 1994.Google Scholar
  10. 10.
    H. Fernau. Observations on grammar and language families. Technical Report 22/94, Universität Karlsruhe (Germany), Fakultät für Informatik, August 1994. Most of this report will appear in Fundamenta Informaticae in 1996.Google Scholar
  11. 11.
    H. Fernau. A note on uniformly limited ET0L systems with unique interpretation. Information Processing Letters, 54:199–204, 1995.CrossRefGoogle Scholar
  12. 12.
    H. Fernau. A predicate for separating language classes. EATCS Bulletin, 56:96–97, June 1995.Google Scholar
  13. 13.
    H. Fernau. Scattered context grammars with regulation. Submitted.Google Scholar
  14. 14.
    H.Fernau. Remarks on propagating partition-limited ET0L systems. Submitted.Google Scholar
  15. 15.
    H. Fernau and H. Bordihn. Remarks on accepting parallel systems. International Journal of Computer Mathematics, 56:51–67, 1995.Google Scholar
  16. 16.
    H. Fernau and D. Wätjen. Remarks on regulated limited ET0L systems and regulated context-free grammars. In preparation.Google Scholar
  17. 17.
    S. Gärtner. Partitions-limitierte Lindenmayer-Systeme. Aachen: Shaker-Verlag, 1995. (Dissertation Technische Universität Braunschweig, Germany).Google Scholar
  18. 18.
    S. Ginsburg and E. H. Spanier. Control sets on grammars. Mathematical Systems Theory, 2:159–177, 1968.CrossRefGoogle Scholar
  19. 19.
    J. Gonczarowski and M. K. Warmuth. Scattered versus context-sensitive rewriting. Acta Informatica, 27:81–95, 1989.CrossRefGoogle Scholar
  20. 20.
    D. Hauschildt and M. Jantzen. Petri net algorithms in the theory of matrix grammars. Acta Informatica, 31:719–728, 1994.CrossRefGoogle Scholar
  21. 21.
    F. Hinz and J. Dassow. An undecidability result for regular languages and its application to regulated rewriting. EATCS Bulletin, 38:168–173, 1989.Google Scholar
  22. 22.
    J. Karhumäki and M. Linna. A note on morphic characterization of languages. Discrete Applied Mathematics, 5:243–246, 1983.CrossRefGoogle Scholar
  23. 23.
    A. Pascu and Gh. Păun. On the planarity of bicolored digraph grammar systems. Discrete Mathematics, 25:195–197, 1979.CrossRefGoogle Scholar
  24. 24.
    D. J. Rosenkrantz. Programmed grammars and classes of formal languages. Journal of the Association for Computing Machinery, 16(1):107–131, 1969.Google Scholar
  25. 25.
    G. Rozenberg and A. K. Salomaa. Context-free grammars with graph-controlled tables. Technical Report DAIMI PB-43, Institute of Mathematics at the University of Aarhus (Denmark), January 1975.Google Scholar
  26. 26.
    A. K. Salomaa. On grammars with restricted use of productions. Annales academiae scientarum Fennicae, Serie A-454:1–32, 1969.Google Scholar
  27. 27.
    A. K. Salomaa. Periodically time-variant context-free grammars. Information and Control, 17:294–311, 1970.Google Scholar
  28. 28.
    A. K. Salomaa. Formal Languages. Academic Press, 1973.Google Scholar
  29. 29.
    E. D. Stotskii. Управление выводом в формальных грамматиках. Проблемы передачи информации, VII(3):87–102, 1971.Google Scholar
  30. 30.
    D. Wätjen. k-limited 0L systems and languages. J. Inf. Process. Cybern. EIK, 24(6):267–285, 1988.Google Scholar
  31. 31.
    D. Wätjen. On k-uniformly-limited T0L systems and languages. J. Inf. Process. Cybern. EIK, 26(4):229–238, 1990.Google Scholar
  32. 32.
    D. Wätjen and E. Unruh. On extended k-uniformly-limited T0L systems and languages. J. Inf. Process. Cybern. EIK, 26(5/6):283–299, 1990.Google Scholar
  33. 33.
    D. Wood. Bicolored digraph grammar systems. RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications, 1:45–50, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Henning Fernau
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany

Personalised recommendations