Skip to main content
SpringerLink
Log in

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III

  • Conference paper
  • First Online:
SOFSEM 2021: Theory and Practice of Computer Science (SOFSEM 2021)

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

Abstract

We discuss substitutions as a further type of operations, added to matrix insertion-deletion systems. For such systems, we additionally discuss the effect of appearance checking. This way, we obtain new characterizations of the families of context-sensitive and the family of recursively enumerable languages. To reach computational completeness, not much context is needed for systems with appearance checking.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Notes

  1. 1.

    Cf. the conclusion of [15], based on a result for insertion-deletion P systems [12].

  2. 2.

    As only one letter is replaced by any substitution rule, there is no subscript at \(\text {SUB}\).

References

  1. Ábrahám, S.: Some questions of phrase-structure grammars. I. Comput. Linguist. 4, 61–70 (1965)

    MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: P systems with minimal insertion and deletion. Theor. Comput. Sci. 412(1–2), 136–144 (2011)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  5. Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer Publishing Company, Incorporated (1989)

    Google Scholar 

  6. Fernau, H., Kuppusamy, L., Raman, I.: Investigations on the power of matrix insertion-deletion systems with small sizes. Nat. Comput. 17(2), 249–269 (2017). https://doi.org/10.1007/s11047-017-9656-8

    Article  MathSciNet  MATH  Google Scholar 

  7. Fernau, H., Kuppusamy, L., Raman, I.: On matrix ins-del systems of small sum-norm. In: Catania, B., Královič, R., Nawrocki, J., Pighizzini, G. (eds.) SOFSEM 2019. LNCS, vol. 11376, pp. 192–205. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-10801-4_16

    Chapter  MATH  Google Scholar 

  8. Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Kari, L., Păun, Gh., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: characterizing recursively enumerable languages using insertion-deletion systems. In: Rubin, H., Wood, D.H. (eds.) DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theretical Computer Science, vol. 48, pp. 329–338 (1999)

    Google Scholar 

  12. 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 

  13. Kuppusamy, L., Mahendran, A., Krishna, S.N.: Matrix insertion-deletion systems for bio-molecular structures. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 301–312. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19056-8_23

  14. Kuppusamy, L., Mahendran, A., Krishna, S.N.: On representing natural languages and bio-molecular structures using matrix insertion-deletion systems and its computational completeness. In: Bel-Enguix, G., Dahl, V., de la Puente, A.O. (eds.) Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology (ICAART 2011). Science and Technology Publications, pp. 47–56 (2011)

    Google Scholar 

  15. Petre, I., Verlan, S.: Matrix insertion-deletion systems. Theor. Comput. Sci. 456, 80–88 (2012)

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  18. 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 

  19. Vu, M., Fernau, H.: Insertion-deletion with substitutions II. In: Jirásková, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 231–243. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-62536-8_19

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bremen, FB 3 – Informatik, Bremen, Germany

    Martin Vu

  2. Universität Trier, FB 4 – Informatik, 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 author

Correspondence to Martin Vu .

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Tomáš Bureš

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Free University of Bozen-Bolzano, Bolzano, Italy

    Johann Gamper

  4. University of Genoa, Genoa, Italy

    Giovanna Guerrini

  5. University of Wroclaw, Wroclaw, Poland

    Tomasz Jurdziński

  6. Free University of Bozen-Bolzano, Bolzano, Italy

    Claus Pahl

  7. University Paris Dauphine, Paris, France

    Florian Sikora

  8. University of Liverpool, Liverpool, UK

    Prudence W.H. Wong

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vu, M., Fernau, H. (2021). Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. In: Bureš, T., et al. SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science(), vol 12607. Springer, Cham. https://doi.org/10.1007/978-3-030-67731-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67731-2_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67730-5

  • Online ISBN: 978-3-030-67731-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation