Communicating Distributed H Systems with Alternating Filters

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


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.


Test Tube Turing Machine Regular Language Garbage Collection Garbage Collector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Ferretti, C., Mauri, G., Zandron, C.: Nine test tubes generate any RE language. Theoretical Computer Science 231(N2), 171–180 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 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. 4.
    Frisco, P., Zandron, C.: On variants of communicating distributed H systems. Fundamenta Informaticae 48(1), 9–20 (2001)zbMATHMathSciNetGoogle Scholar
  5. 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)zbMATHMathSciNetGoogle Scholar
  6. 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. 7.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)zbMATHGoogle Scholar
  8. 8.
    Kleene, S.: Introduction to Metamathematics. Van Nostrand Comp. Inc., New York (1952)zbMATHGoogle Scholar
  9. 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. 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)CrossRefGoogle Scholar
  11. 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. 12.
    Păun, G.: Regular extended H systems are computationally universal. J. Automata, Languages, and Combinatorics 1(1), 27–36 (1996)zbMATHGoogle Scholar
  13. 13.
    Păun, G.: DNA computing based on splicing: universality results. Theoretical Computer Science 231(2), 275–296 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Berlin (1998)zbMATHGoogle Scholar
  15. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sergey Verlan
    • 1
  1. 1.Laboratoire d’Informatique Théorique et AppliquéeUniversité de MetzFrance

Personalised recommendations