Skip to main content
SpringerLink
Log in

A jumping \(5'\rightarrow 3'\) Watson–Crick finite automata model

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Jumping finite automata and sensing \(5'\rightarrow 3'\) Watson–Crick finite automata are finite-state models of computation which allow to process the input word not only in the strictly left-to-right manner. In this paper a new combined model of them is presented. The accepting power of the new model is studied and compared with the original models and also other well-known language families. Furthermore, the paper investigates changes in the accepting power when commonly studied restrictions from Watson–Crick finite automata, e.g., all states are final, are applied to this combined model. In the end, the paper presents a comprehensive hierarchy of all related language families.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Beier, S., Holzer, M.: Decidability of right one-way jumping finite automata. In: DLT 2018, LNCS, vol. 11088, pp. 109–120 (2018). https://doi.org/10.1007/978-3-319-98654-8_9

  2. Beier, S., Holzer, M., Kutrib, M.: Operational state complexity and decidability of jumping finite automata. In: DLT 2017, LNCS, vol. 10396, pp. 96–108 (2017). https://doi.org/10.1007/978-3-319-62809-7_6

  3. Chigahara, H., Fazekas, S.Z., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(03), 391–405 (2016). https://doi.org/10.1142/S0129054116400165

    Article  MathSciNet  MATH  Google Scholar 

  4. Fazekas, S.Z., Hoshi, K., Yamamura, A.: Enhancement of automata with jumping modes. In: Automata 2019, LNCS, vol. 11525, pp. 62–76 (2019). https://doi.org/10.1007/978-3-030-20981-0_5

  5. Fazekas, S.Z., Yamamura, A.: On regular languages accepted by one-way jumping finite automata. In: Eighth Workshop on Non-classical Models of Automata and Applications (NCMA 2016) Short papers, pp. 7–14 (2016)

  6. Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: CIAA 2015, LNCS, vol. 9223, pp. 89–101. Springer (2015). https://doi.org/10.1007/978-3-319-22360-5_8

  7. Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679, 31–52 (2017). https://doi.org/10.1016/j.tcs.2016.07.006

    Article  MathSciNet  MATH  Google Scholar 

  8. Kocman, R., Křivka, Z., Meduna, A.: On double-jumping finite automata. In: Eighth Workshop on Non-classical Models of Automata and Applications (NCMA 2016), OCG, vol. 321, pp. 195–210 (2016)

  9. Kocman, R., Křivka, Z., Meduna, A.: On double-jumping finite automata and their closure properties. RAIRO Theor. Inf. Appl. 52(2–4), 185–199 (2018). https://doi.org/10.1051/ita/2018013

    Article  MathSciNet  MATH  Google Scholar 

  10. Kocman, R., Meduna, A.: On parallel versions of jumping finite automata. In: SDOT 2015, AICS, vol. 511, pp. 142–149 (2016). https://doi.org/10.1007/978-3-319-46535-7_12

  11. Kocman, R., Nagy, B., Křivka, Z., Meduna, A.: A jumping \(5^{\prime }\rightarrow 3^{\prime }\) Watson–Crick finite automata model. In: Tenth Workshop on Non-classical Models of Automata and Applications (NCMA 2018), OCG, vol. 332, pp. 117–132 (2018)

  12. Kuske, D., Weigel, P.: The role of the complementarity relation in Watson–Crick automata and sticker systems. In: DLT 2004, LNCS, vol. 3340, pp. 272–283 (2005). https://doi.org/10.1007/978-3-540-30550-7_23

  13. Křivka, Z., Meduna, A.: Jumping grammars. Int. J. Found. Comput. Sci. 26(6), 709–731 (2015). https://doi.org/10.1142/S0129054115500409

    Article  MathSciNet  MATH  Google Scholar 

  14. Madejski, G.: Jumping and pumping lemmas and their applications. In: Eighth Workshop on Non-classical Models of Automata and Applications (NCMA 2016) Short Papers, pp. 25–33 (2016)

  15. Mahalingam, K., Raghavan, R., Mishra, U.K.: Watson–Crick jumping finite automata. In: TAMC 2019, LNCS, vol. 11436, pp. 467–480. Springer (2019). https://doi.org/10.1007/978-3-030-14812-6_29

  16. Meduna, A.: Automata and Languages: Theory and Applications. Springer, London (2000)

    Book  Google Scholar 

  17. Meduna, A., Soukup, O.: Jumping scattered context grammars. Fundam. Inf. 152(1), 51–86 (2017). https://doi.org/10.3233/FI-2017-1512

    Article  MathSciNet  MATH  Google Scholar 

  18. Meduna, A., Soukup, O.: Modern Language Models and Computation: Theory with Applications. Springer, Berlin (2017). https://doi.org/10.1007/978-3-319-63100-4

    Book  MATH  Google Scholar 

  19. Meduna, A., Techet, J.: Scattered Context Grammars and Their Applications. WIT Press, Southampton (2010)

    MATH  Google Scholar 

  20. Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012). https://doi.org/10.1142/S0129054112500244

    Article  MathSciNet  MATH  Google Scholar 

  21. Meduna, A., Zemek, P.: Regulated Grammars and Automata. Springer, Berlin (2014)

    Book  Google Scholar 

  22. Nagy, B.: On \(5^{\prime }\rightarrow 3^{\prime }\) sensing Watson–Crick finite automata. In: The 13th International Meeting on DNA Computing (DNA13), pp. 327–336 (2007)

  23. Nagy, B.: On \(5^{\prime }\rightarrow 3^{\prime }\) sensing Watson–Crick finite automata. In: DNA 13, LNCS, vol. 4848, pp. 256–262 (2008). https://doi.org/10.1007/978-3-540-77962-9_27

  24. Nagy, B.: \(5^{\prime }\rightarrow 3^{\prime }\) sensing Watson–Crick finite automata. In: Fung, G. (ed.) Sequence and Genome Analysis II–Methods and Applications, pp. 39–56. iConcept Press, Hong Kong (2010)

    Google Scholar 

  25. Nagy, B.: On a hierarchy of \(5^{\prime }\rightarrow 3^{\prime }\) sensing Watson–Crick finite automata languages. J. Log. Comput. 23(4), 855–872 (2013). https://doi.org/10.1093/logcom/exr049

    Article  MathSciNet  MATH  Google Scholar 

  26. Nagy, B., Kovács, Z.: On simple \(5^{\prime }\rightarrow 3^{\prime }\) sensing Watson–Crick finite-state transducers. In: Eleventh Workshop on Non-classical Models of Automata and Applications (NCMA 2019), pp. 155–170 (2019)

  27. Nagy, B., Otto, F.: Two-head finite-state acceptors with translucent letters. In: SOFSEM 2019, LNCS, vol. 11376, pp. 406–418 (2019). https://doi.org/10.1007/978-3-030-10801-4_32

  28. Nagy, B., Otto, F.: Linear automata with translucent letters and linear context-free trace languages. RAIRO Theor. Informatics Appl. 54, 3 (2020). https://doi.org/10.1051/ita/2020002

  29. Nagy, B., Parchami, S.: On deterministic sensing \(5^{\prime }\rightarrow 3^{\prime }\) Watson–Crick finite automata: a full hierarchy in 2detLIN. Acta Inform. 58(3), 153–175 (2021). https://doi.org/10.1007/s00236-019-00362-6

  30. Nagy, B., Parchami, S., Mir-Mohammad-Sadeghi, H.: A new sensing \(5^{\prime }\rightarrow 3^{\prime }\) Watson–Crick automata concept. In: AFL 2017, EPTCS, vol. 252, pp. 195–204 (2017). https://doi.org/10.4204/EPTCS.252.19

  31. Parchami, S., Nagy, B.: Deterministic sensing \(5^{\prime }\rightarrow 3^{\prime }\) Watson–Crick automata without sensing parameter. In: UCNC 2018, LNCS, vol. 10876, pp. 173–187 (2018). https://doi.org/10.1007/978-3-319-92435-9_13

  32. Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Berlin Heidelberg (1998)

    Book  Google Scholar 

  33. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, Linear Modeling: Background and Application, vol. 2. Springer, Berlin (1997)

    Book  Google Scholar 

  34. Vorel, V.: On basic properties of jumping finite automata. Int. J. Found. Comput. Sci. 29(1), 1–15 (2018). https://doi.org/10.1142/S0129054118500016

    Article  MathSciNet  MATH  Google Scholar 

  35. Wood, D.: Theory of Computation: A Primer. Addison-Wesley, Boston (1987)

    Google Scholar 

Download references

Acknowledgements

This work was supported by The Ministry of Education, Youth and Sports of the Czech Republic from the National Programme of Sustainability (NPU II); project IT4Innovations excellence in science - LQ1602. The authors would like to thank the anonymous referees for their insightful comments and detailed suggestions that helped to significantly improve the quality of the paper.

Author information

Authors and Affiliations

  1. Centre of Excellence IT4Innovations, Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno, Czech Republic

    Radim Kocman, Zbyněk Křivka & Alexander Meduna

  2. Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, Famagusta, North Cyprus, Mersin-10, Turkey

    Benedek Nagy

Authors
  1. Radim Kocman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zbyněk Křivka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Meduna
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zbyněk Křivka.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

An early stage of this research was presented in NCMA 2018, see [11].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kocman, R., Křivka, Z., Meduna, A. et al. A jumping \(5'\rightarrow 3'\) Watson–Crick finite automata model. Acta Informatica 59, 557–584 (2022). https://doi.org/10.1007/s00236-021-00413-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-021-00413-x

Search

Navigation