Advertisement

Soft Computing

, Volume 5, Issue 2, pp 121–125 | Cite as

Sequences of languages in forbidding–enforcing families

  • A. Ehrenfeucht
  • H. J. Hoogeboom
  • G. Rozenberg
  • N. van Vugt
Focus: Toward Soft Hardware

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.

Keywords Molecular computing Formal languages Convergence 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • A. Ehrenfeucht
    • 2
  • H. J. Hoogeboom
    • 1
  • G. Rozenberg
    • 1
  • N. van Vugt
    • 1
  1. 1.LIACS, Universiteit Leiden, P.O. Box 9512, 2300 RA Leiden The Netherlands e-mail: nvvugt@liacs.nlNL
  2. 2.Department of Computer Science University of Colorado at Boulder Boulder, CO 80309, USAUS

Personalised recommendations