IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-015-9634-3_35.html
   My bibliography  Save this book chapter

Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages

In: Where Mathematics, Computer Science, Linguistics and Biology Meet

Author

Listed:
  • Maurice Margenstern

    (University Institute of Technology, Metz Group of Foundational Computer Science)

  • Yurii Rogozhin

    (Academy of Sciences of Moldova, Institute of Mathematics and Informatics)

Abstract

A time-varying distributed H system is a splicing system which has the following feature: at different moments one uses different sets of splicing rules. The number of these sets is called the degree of the system. The passing from one set of rules to another is specified in a cycle. It is known that any formal language can be generated by a time-varying distributed H-system of degree at least 4. We already proved that there are universal time-varying distributed H-systems of degree 2. In this paper we strengthen that result by showing, for any recursively enumerable language, how to construct a time-varying distributed H-system of degree 2 that generates that language exactly. We also indicate that such a construction is impossible for time-varying distributed H-systems of degree 1.

Suggested Citation

  • Maurice Margenstern & Yurii Rogozhin, 2001. "Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages," Springer Books, in: Carlos Martín-Vide & Victor Mitrana (ed.), Where Mathematics, Computer Science, Linguistics and Biology Meet, chapter 0, pages 399-407, Springer.
    • Handle: RePEc:spr:sprchp:978-94-015-9634-3_35
    DOI: 10.1007/978-94-015-9634-3_35
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-015-9634-3_35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.