Skip to main content
SpringerLink
Log in

Context-Free Valence Grammars - Revisited

  • Conference paper
  • First Online:
Book cover 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:

Abstract

Context-free valence languages (over ℤк) are shown to be codings of the intersection of a context-free language and a blind к-counter language. This afl-style characterization allows one to infer some of the properties of the family of valence languages, in particular the ⋋-free normal form proved by Fernau and Stiebe.

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. T. Head, G. Păun, D. Pixton. Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination. In: G. Rozenberg and A. Salomaa (eds.) Handbook of Formal Languages, volume 2. Springer-Verlag, 1997.

    Google Scholar 

  2. H.J. Hoogeboom, N. vanVugt. Upper Bounds for Restricted Splicing. LIACS Technical Report 01–05, 2001. Submitted.

    Google Scholar 

  3. L. Kari, G. Păun, A. Salomaa. The Power of Restricted Splicing with Rules from a Regular Language. Journal of Universal Computer Science, 2 (1996) 224–240.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Advanced Computer Science, Universiteit Leiden, The Netherlands

    Hendrik Jan Hoogeboom

Authors
  1. Hendrik Jan Hoogeboom
    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

Hoogeboom, H.J. (2002). Context-Free Valence Grammars - Revisited. 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_25

Download citation

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

  • 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