Skip to main content
SpringerLink
Log in

Communicating Distributed H Systems with Alternating Filters

  • Chapter
Aspects of Molecular Computing

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

Abstract

We present a variant of communicating distributed H systems where each filter is substituted by a tuple of filters. Such systems behave like original ones with the difference that at each moment we use one element of the tuple for the filtering process and this element is replaced after each use, periodically. We show that it suffices to use tuples of two filters in order to generate any recursively enumerable language, with two tubes only. We also show that it is possible to obtain the same result having no rules in the second tube which acts as a garbage collector. Moreover, the two filters in a tuple differ only in one letter. We also present different improvements and open questions.

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. Csuhaj-Varju, E., Kari, L., Păun, G.: Test tube distributed systems based on splicing. Computers and Artificial Intelligence 15(2), 211–232 (1996)

    MATH  MathSciNet  Google Scholar 

  2. Ferretti, C., Mauri, G., Zandron, C.: Nine test tubes generate any RE language. Theoretical Computer Science 231(N2), 171–180 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Freund, R., Freund, F.: Test tube systems: when two tubes are enough. In: Preproceedings of DLT 1999: Developments in Languages Theory, Aachen, July 6-9, pp. 275–286 (1999)

    Google Scholar 

  4. Frisco, P., Zandron, C.: On variants of communicating distributed H systems. Fundamenta Informaticae 48(1), 9–20 (2001)

    MATH  MathSciNet  Google Scholar 

  5. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology 49, 737–759 (1987)

    MATH  MathSciNet  Google Scholar 

  6. Head, T., Păun, G., Pixton, D.: Language theory and molecular genetics. In: Rozenberg, G., Salomaa, A. (eds.) Generative mechanisms suggested by DNA recombination, Handbook of Formal Languages, vol. 2, ch. 5. Springer, Heidelberg (1997)

    Google Scholar 

  7. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  8. Kleene, S.: Introduction to Metamathematics. Van Nostrand Comp. Inc., New York (1952)

    MATH  Google Scholar 

  9. Margenstern, M., Rogozhin, Y., Verlan, S.: Time-varying distributed H systems with parallel computations: the problem is solved. In: Preproceedings of DNA 9, Madison, USA, June 1-4, pp. 47–51 (2003)

    Google Scholar 

  10. Margenstern, M., Rogozhin, Y.: Time-varying distributed H systems of degree 1 generate all recursively enumerable languages. In: Ito, M., Păun, G., Yu, S. (eds.) Words, Semigroups and Transductions, pp. 329–340. World Scientific, Singapore (2001)

    Chapter  Google Scholar 

  11. P˘aun, G.: In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 353–370. Springer, Heidelberg (1997)

    Google Scholar 

  12. Păun, G.: Regular extended H systems are computationally universal. J. Automata, Languages, and Combinatorics 1(1), 27–36 (1996)

    MATH  Google Scholar 

  13. Păun, G.: DNA computing based on splicing: universality results. Theoretical Computer Science 231(2), 275–296 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Berlin (1998)

    MATH  Google Scholar 

  15. Priese, L., Rogozhin, Y., Margenstern, M.: Finite H-Systems with 3 Test Tubes are not Predictable. In: Altman, R.B., Dunker, A.K., Hunter, L., Klein, T.E. (eds.) Proceedings of Pacific Symposium on Biocomputing, Kapalua, Maui, January 1998, pp. 545–556. World Sci. Publ., Singapore (1998)

    Google Scholar 

  16. Verlan, S.: A frontier result on enhanced time-varying distributed H systems with parallel computations. In: Preproceeding of DCFS 2003, Budapest, Hungary, July 12–14, pp. 221–232 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Théorique et Appliquée, Université de Metz, France

    Sergey Verlan

Authors
  1. Sergey Verlan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of South Florida, 4202 E. Fowler Ave, 33620, Tampa, Fl, USA

    Nataša Jonoska

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Verlan, S. (2003). Communicating Distributed H Systems with Alternating Filters. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

  • Online ISBN: 978-3-540-24635-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation