Sequences of languages in forbidding–enforcing families | Soft Computing Skip to main content
Springer Nature Link
Log in

Sequences of languages in forbidding–enforcing families

  • Focus: Toward Soft Hardware
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

 Forbidding-enforcing systems were introduced as a model of molecular processes, with DNA computing as one of the intended application areas. A number of results concerning fe systems deal with the fact that for an infinite ascending sequence of languages satisfying certain properties, their union satisfies the same, or closely related, properties. We generalize these results, mainly by lifting them to converging (in the topological sense) sequences of languages. Furthermore, we discuss in detail the importance of (sequences of) finite languages in forbidding and enforcing families.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  1. LIACS, Universiteit Leiden, P.O. Box 9512, 2300 RA Leiden The Netherlands e-mail: nvvugt@liacs.nl, , , , , , NL

    H. J. Hoogeboom, G. Rozenberg & N. van Vugt

  2. Department of Computer Science University of Colorado at Boulder Boulder, CO 80309, USA, , , , , , US

    A. Ehrenfeucht

Authors
  1. A. Ehrenfeucht
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. H. J. Hoogeboom
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. G. Rozenberg
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. N. van Vugt
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ehrenfeucht, A., Hoogeboom, H., Rozenberg, G. et al. Sequences of languages in forbidding–enforcing families. Soft Computing 5, 121–125 (2001). https://doi.org/10.1007/s005000000072

Download citation

  • Issue Date:

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