Skip to main content
SpringerLink
Log in

Regulation by valences

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1997 (MFCS 1997)

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

Abstract

Valences are a very simple and yet powerful method of regulated rewriting. In this paper we give an overview on different aspects of this subject. We discuss closure properties of valence languages. It is shown that matrix grammars can be simulated by valence grammars over finite monoids. A Chomsky normal form theorem is proved for multiplicative valence grammars, thereby solving the open question of the existence of normal forms for unordered vector grammars. This also gives an alternative proof of the inclusion of context-free unordered vector languages in LOG(CFL). Moreover, we investigate valences in parallel systems, thereby solving part of open problems posted in [5, p. 267].

Supported by Deutsche Forschungsgemeinschaft grant DFG La 618/3-1.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. A. M. Barrington and D. Thérien. Finite monoids and the fine structure of NC1. Journal of the Association for Computing Machinery, 35(4):941–952, October 1988.

    Google Scholar 

  2. F. Bédard, F. Lémieux, and P. McKenzie. Extensions to Barrington's M-program model. Theoretical Computer Science, 107:31–61, 1993.

    Article  Google Scholar 

  3. F. Berman. Edge Grammars and parallel computation. In: Proceedings of the 1983 Allerton Conference, pages 214–223, 1983.

    Google Scholar 

  4. J. Berstel. Transductions and Context-Free Languages. Stuttgart: Teubner, 1979.

    Google Scholar 

  5. J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory. Berlin: Springer, 1989.

    Google Scholar 

  6. M. Gheorge. Linear valence grammars. In: International Meeting of Young Computer Scientists, pages 281–285, 1986.

    Google Scholar 

  7. S. Greibach. Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science, 7:311–324, 1978.

    Article  Google Scholar 

  8. E. M. Gurari and O. H. Ibarra. The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences, 22:220–229, 1981.

    Article  Google Scholar 

  9. O. H. Ibarra, S. K. Sahni, and C. E. Kim. Finite automata with multiplication. Theoretical Computer Science, 2:271–296, 1976.

    Article  Google Scholar 

  10. M. Marcus and Gh. Păun. Valence gsm-mappings. Bull. Math. Soc. Sci. Math. Roumanie, 31(3):219–229, 1987.

    Google Scholar 

  11. V. Mitrana. Valence grammars on a free generated group. EATCS Bulletin, 47:174–179, 1992.

    Google Scholar 

  12. V. Mitrana and R. Stiebe. Extended finite automata over groups. Accepted for First International Conference on Semigroups and Algebraic Engeneering, Aizu, Japan: 1997.

    Google Scholar 

  13. Gh. Păun. A new generative device: valence grammars. Rev. Roumaine Math. Pures Appl., XXV(6):911–924, 1980.

    Google Scholar 

  14. Gh. Păun. On a class of valence grammars. Stud. cerc. mat., 42:255–268, 1990.

    Google Scholar 

  15. Gh. Păun. Valences: increasing the power of grammars, transducers, grammar systems. EATCS Bulletin, 48:143–156, 1992.

    Google Scholar 

  16. V. Red'ko and L. Lisovik. Regular events in semigroup. Problems of Cybernetics, 37:155–184, 1980. In Russian.

    Google Scholar 

  17. J. J. Rotman. An Introduction to the Theory of Groups. New York: Springer, 5th edition, 1995.

    Google Scholar 

  18. G. Rozenberg and A. K. Salomaa.The Mathematical Theory of L Systems. Academic Press, 1980.

    Google Scholar 

  19. A. K. Salomaa. Formal Languages. Academic Press, 1973.

    Google Scholar 

  20. G. Satta. The membership problem for unordered vector grammars. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II, pages 267–275, 1996.

    Google Scholar 

  21. I. H. Sudborough. The complexity of the membership problem for some extensions of context-free languages. International Journal of Computer Mathematics, 6:191–215, 1977.

    Google Scholar 

  22. S. Vicolov. Hierarchies of valence languages. In J. Dassow and A. Kelemenova, editors, Developments in Theoretical Computer Science, pages 191–196. Basel: Gordon and Breach, 1994.

    Google Scholar 

  23. S. Vicolov-Dumitrescu. Grammars, grammar systems, and gsm. mappings with valences. In Gh. Păun, editor, Mathematical Aspects of Natural and Formal Languages, pages 473–491. Singapore: World Scientific, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickhard-Institut für Informatik, Sand 13, D-72076, Tübingen, Germany

    Henning Fernau

  2. Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, Kurt-Mothes-Str. 1, D-06120, Halle, Germany

    Ralf Stiebe

Authors
  1. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Stiebe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernau, H., Stiebe, R. (1997). Regulation by valences. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029967

Download citation

  • DOI: https://doi.org/10.1007/BFb0029967

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63437-9

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation