Skip to main content
SpringerLink
Log in

Valuated and Valence Grammars: An Algebraic View

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

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

Included in the following conference series:

  • 446 Accesses

Abstract

Valence grammars were introduced by Gh. Păun in [8] as a grammatical model of chemical processes. Here, we focus on discussing a simpler variant which we call valuated grammars.We give some algebraic characterizations of the corresponding language classes. Similarly,we obtain an algebraic characterization of the linear languages. We also give some Nivat-like representations of valence transductions.

Work was done while the author was withWilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

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.

    MathSciNet  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  MATH  MathSciNet  Google Scholar 

  3. J. Berstel. Transductions and Context-Free Languages, volume 38 of LAMM. Stuttgart: Teubner, 1979.

    MATH  Google Scholar 

  4. S. Eilenberg. Automata, Languages, and Machines,Volume B. Pure andApplied Mathematics. NewYork: Academic Press, 1976.

    Google Scholar 

  5. H. Fernau and R. Stiebe. Sequential grammars and automata with valences. Technical Report WSI-2000-25, Universität Tübingen (Germany),Wilhelm-Schickard-Institut für Informatik, 2000. Revised version to appear in Theoretical Computer Science. Up to publication, it can be retrieved from the webpage of Elsevier.

    Google Scholar 

  6. M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley series in computer science. Reading (MA): Addison-Wesley, 1978.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  9. J.-E. Pin. Varieties of formal languages. NewYork: Plenum Press, 1986.

    MATH  Google Scholar 

  10. V. Red’ko and L. Lisovik. Regular events in semigroups (in Russian). Problems of Cybernetics, 37:155–184, 1980.

    MathSciNet  Google Scholar 

  11. D. Thérien. Classification of finite monoids: the language approach. Theoretical Computer Science, 14:195–208, 1981.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Software Engineering University Drive, University of Newcastle, 2308, Callaghan, NSW, Australia

    Henning Fernau

  2. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PF-4120, D-39016, Magdeburg, 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

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernau, H., Stiebe, R. (2002). Valuated and Valence Grammars: An Algebraic View. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation