Skip to main content
Springer Nature Link
Log in

On the Power of Small Watson-Crick Automata and Variants of String Assembling Systems

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2024)

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

Included in the following conference series:

  • 27 Accesses

Abstract

We investigate the relationship of languages characterized by variants of string assembling systems and by Watson-Crick automata with a small number of states. Besides the general variant, we consider so-called free and pure string assembling systems, and compare their language generating power to Watson-Crick automata having one, two, or three states in their state sets. In some cases, restricted variants of the models describing unary languages are also considered.

Supported by the University of Debrecen Scientific Research Bridging Fund (DETKA).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Freund, R., Păun, G., Rozenberg, G., Salomaa, A.: Watson-Crick finite automata. In: Rubin, H., Wood, D.H. (eds.) DNA Based Computers, Proceedings of a DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 48, pp. 297–327. DIMACS/AMS (1997)

    Google Scholar 

  2. Kari, L., Păun, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems, and universality. Acta Inform. 35(5), 401–420 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kari, L., Seki, S., Sosík, P.: DNA computing - foundations and implications. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 1073–1127. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-540-92910-9_33

  4. Kuske, D., Weigel, P.: The role of the complementarity relation in Watson-Crick automata and sticker systems. In: Calude, C., Calude, E., Dinneen, M.J. (eds.) Developments in Language Theory, 8th International Conference, DLT 2004, Proceedings. Lecture Notes in Computer Science, vol. 3340, pp. 272–283. Springer (2004)

    Google Scholar 

  5. Kutrib, M., Wendlandt, M.: String assembling systems. RAIRO Theor. Inform. Appl. 46(4), 593–613 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kutrib, M., Wendlandt, M.: Variants of string assembling systems. Nat. Comput. 23, 131–156 (2024)

    Article  MathSciNet  MATH  Google Scholar 

  7. Murvai, A., Vaszil, G.: String assembling systems and Watson-Crick finite automata. In: Brejová, B., Ciencialová, L., Holena, M., Mráz, F., Pardubská, D., Plátek, M., Vinar, T. (eds.) Proceedings of the 21st Conference Information Technologies - Applications and Theory (ITAT 2021). CEUR Workshop Proceedings, vol. 2962, pp. 210–216. CEUR-WS.org (2021). https://ceur-ws.org/Vol-2962/paper44.pdf

  8. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing - New Computing Paradigms. Texts in Theoretical Computer Science. An EATCS Series. Springer (1998)

    Google Scholar 

  9. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Volume 1: Word, Language, Grammar. Springer (1997). https://doi.org/10.1007/978-3-642-59136-5

  10. Salomaa, A.: Formal Languages. Academic Press (1973)

    Google Scholar 

  11. Sempere, J.M.: On the languages accepted by Watson-Crick finite automata with delays. Mathematics 9(8) (2021). https://doi.org/10.3390/math9080813

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics, University of Debrecen, Kassai út 26, Debrecen, 4028, Hungary

    András Murvai & György Vaszil

Authors
  1. András Murvai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to György Vaszil .

Editor information

Editors and Affiliations

  1. Université Côte d'Azur, Sophia Antipolis, France

    Enrico Formenti

  2. University of Orléans, Orléans, France

    Jérôme Durand-Lose

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Murvai, A., Vaszil, G. (2025). On the Power of Small Watson-Crick Automata and Variants of String Assembling Systems. In: Formenti, E., Durand-Lose, J. (eds) Machines, Computations, and Universality. MCU 2024. Lecture Notes in Computer Science, vol 15270. Springer, Cham. https://doi.org/10.1007/978-3-031-81202-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-81202-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-81201-9

  • Online ISBN: 978-3-031-81202-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics