Skip to main content
SpringerLink
Log in

Insertion-Deletion with Substitutions II

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12442))

Included in the following conference series:

Abstract

We discuss substitutions as a further type of operations, added to (in particular, one-sided) insertion-deletion systems. This way, we obtain new characterizations of classes of context-sensitive and recursively enumerable languages. Moreover, we obtain new families of languages containing all regular or contained in the context-free languages.

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 EPUB and 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

References

  1. Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Small size insertion and deletion systems. In: Martin-Vide, C. (ed.) Applications of Language Methods, pp. 459–515. Imperial College Press (2010)

    Google Scholar 

  2. Beaver, D.: Computing with DNA. J. Comput. Biol. 2(1), 1–7 (1995)

    Article  Google Scholar 

  3. Haussler, D.: Insertion languages. Inf. Sci. 31(1), 77–89 (1983)

    Article  MathSciNet  Google Scholar 

  4. Kari, L.: On insertions and deletions in formal languages. Ph.D. thesis, University of Turku, Finland (1991)

    Google Scholar 

  5. Karl, L.: DNA computing: arrival of biological mathematics. Math. Intell. 19(2), 9–22 (1997). https://doi.org/10.1007/BF03024425

    Article  MathSciNet  MATH  Google Scholar 

  6. Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Further results on insertion-deletion systems with one-sided contexts. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 333–344. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88282-4_31

    Chapter  Google Scholar 

  7. Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Computational power of insertion-deletion (P) systems with rules of size two. Nat. Comput. 10, 835–852 (2011)

    Article  MathSciNet  Google Scholar 

  8. Margenstern, M., Păun, Gh., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2), 339–348 (2005)

    Article  MathSciNet  Google Scholar 

  9. Matveevici, A., Rogozhin, Y., Verlan, S.: Insertion-deletion systems with one-sided contexts. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 205–217. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74593-8_18

    Chapter  Google Scholar 

  10. Păun, Gh., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998). https://doi.org/10.1007/978-3-662-03563-4

    Book  MATH  Google Scholar 

  11. Penttonen, M.: One-sided and two-sided context in formal grammars. Inf. Control (now Inf. Comput.) 25, 371–392 (1974)

    Article  MathSciNet  Google Scholar 

  12. Takahara, A., Yokomori, T.: On the computational power of insertion-deletion systems. Nat. Comput. 2(4), 321–336 (2003)

    Article  MathSciNet  Google Scholar 

  13. Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210–245 (2010)

    MathSciNet  MATH  Google Scholar 

  14. Vu, M.: On insertion-deletion systems with substitution rules. Master’s thesis, Informatikwissenschaften, Universität Trier, Germany (2019)

    Google Scholar 

  15. Vu, M., Fernau, H.: Insertion-deletion systems with substitutions I. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 366–378. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51466-2_33

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB3 - Informatik, Universität Bremen, Bremen, Germany

    Martin Vu

  2. Universität Trier, Fachber. 4 – Abteilung Informatikwissenschaften, 54286, Trier, Germany

    Henning Fernau

Authors
  1. Martin Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Martin Vu or Henning Fernau .

Editor information

Editors and Affiliations

  1. Slovak Academy of Sciences, Košice, Slovakia

    Galina Jirásková

  2. University of Milan, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vu, M., Fernau, H. (2020). Insertion-Deletion with Substitutions II. In: Jirásková, G., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2020. Lecture Notes in Computer Science(), vol 12442. Springer, Cham. https://doi.org/10.1007/978-3-030-62536-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62536-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62535-1

  • Online ISBN: 978-3-030-62536-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation