EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 60 (2026) RAIRO-Theor. Inf. Appl., 60 (2026) 2 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 60, 2026
Article Number 2
Number of page(s) 21
DOI https://doi.org/10.1051/ita/2026004
Published online 03 February 2026
  1. J.-É. Pin (ed.), Handbook of Automata Theory, 2 vols. EMS Press, 2021. [Google Scholar]
  2. G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages. Springer (1997). [Google Scholar]
  3. L.M. Adleman, Molecular computation of solutions to combinatorial problems. Science 226 (1994) 1021–1024. [Google Scholar]
  4. R.J. Lipton, DNA solution of hard computational problems. Science 268 (1995) 542–545. [Google Scholar]
  5. G. Paun, G. Rozenberg and A. Salomaa, DNA Computing: New Computing Paradigms. Springer-Verlag (2002). [Google Scholar]
  6. E. Czeizler and E. Czeizler, A Short Survey on Watson-Crick Automata. Bull. EATCS 88 (2006) 104–119. [Google Scholar]
  7. R. Freund, G. Paun, G. Rozenberg and A. Salomaa, Watson-Crick finite automata, in 3rd DIMACS Symposium On DNA Based Computers, Philadelphia (1997) 305–317. [Google Scholar]
  8. J.M. Sempere, A Representation theorem for languages accepted by Watson-Crick finite automata. Bull. EATCS 83 (2004) 187–191. [Google Scholar]
  9. J.M. Sempere, On the application of Watson-Crick finite automata for the resolution of bioinformatic problems, in Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, edited by R. Freund, M. Hospodâr, G. Jirâskovâ and G. Pighizzini. (Österreichische Computer Gesellschaft Invited talk (2018) 29–30. [Google Scholar]
  10. L. Hegedus, B. Nagy and O. Egecioglu, Stateless multicounter 5' → 3' Watson-Crick automata: the deterministic case. Natural Comput. 11 (2012) 361–368. [Google Scholar]
  11. P. Leupold and B. Nagy, 5' → 3' Watson-Crick automata with several runs. Fundam. Inform. 104 (2010) 71–91. [Google Scholar]
  12. B. Nagy, On 5' → 3' sensing Watson-Crick finite automata, in DNA Computing. DNA 2007: Selected revised papers, Lecture Notes in Computer Science, LNCS, vol. 4848, edited by M.H. Garzon and H. Yan. Springer, Berlin, Heidelberg (2008) 256–262. [Google Scholar]
  13. B. Nagy, On a hierarchy of 5' → 3' sensing WK finite automata languages, in Computaility in Europe, CiE 2009: Mathematical Theory and Computational Practice, Abstract Booklet, Heidelberg, edited by K. Ambos-Spies, B. Love and W. Merkle (2009) 266–275. [Google Scholar]
  14. B. Nagy, 5' → 3' sensing Watson-Crick finite automata, in Sequence and Genome Analysis II - Methods and Applications, edited by G. Fung. iConcept Press (2010) 39–56. [Google Scholar]
  15. B. Nagy, On a hierarchy of 5' → 3' sensing Watson-Crick finite automata languages. J. Logic Computat. 23 (2013) 855–872. [Google Scholar]
  16. B. Nagy and S. Parchami, 5' → 3' Watson-Crick automata languages - without the sensing parameter. Natural Comput. 21 (2022) 679–691. [Google Scholar]
  17. B. Nagy, S. Parchami H.M. Mohammad Sadeghi, A new sensing 5' → 3' Watson-Crick automata concept, in Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 252, edited by E. Csuhaj-Varju, P. Dömösi and Gy. Vaszil (2017) 195–204. [Google Scholar]
  18. E. Czeizler, E. Czeizler, L. Kari and K. Salomaa, Watson-Crick automata: determinism and state complexity, in 10th International Workshop on Desciptional Complexity of Formal Systems, DCFS 2008, edited by C. Campeanu and G. Pighizzini. University of Prince Edward Island (2008) 121–133. [Google Scholar]
  19. E. Czeizler, E. Czeizler, L. Kari and K. Salomaa, On the descriptional complexity of Watson-Crick automata. Theor. Comput. Sci. 410 (2009) 3250–3260. [Google Scholar]
  20. K. Sankar Ray, K. Chatterjee and D. Ganguly, State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata. Natural Comput. 14 (2015) 691–699. [Google Scholar]
  21. D. Kuske and P. Weigel, The role of the complementarity relation in Watson-Crick automata and sticker systems, in Developments in Language Theory, DLT 2004, Lecture Notes in Computer Science, LNCS, vol. 3340, edited by C.S. Calude, E. Calude and M.J. Dinneen. Springer, Berlin, Heidelberg (2004) 272–283. [Google Scholar]
  22. B. Nagy and S. Parchami, On deterministic sensing 5' → 3' Watson-Crick finite automata: a full hierarchy in 2detLIN. Acta Inform. 58 (2021) 153–175. [Google Scholar]
  23. S. Parchami and B. Nagy, Deterministic sensing 5' → 3' Watson-Crick automata without sensing parameter, in Unconventional Computation and Natural Computation, UCNC 2018 LNCS, vol. 10867, edited by S. Stepney and S. Verlan. Springer (2018) 173–187. [Google Scholar]
  24. B. Nagy, State-deterministic 5' → 3' Watson-Crick automata. Natural Comput. 20 (2021) 725–737. [Google Scholar]
  25. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979). [Google Scholar]
  26. M. Fatima and B. Nagy, Transduced-input automata with translucent letters. Comptes Rendus Acad. Bul. Sci. 73 (2020) 33–39. [Google Scholar]
  27. B. Nagy and F. Otto, Finite-state acceptors with translucent letters, in BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proceeding, edited by G. Bel-Enguix, V. Dahl and A.O. De La Puente SciTePress, Portugal (2011) 3–13. [Google Scholar]
  28. B. Nagy and F. Otto, On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78 (2012) 780–806. [Google Scholar]
  29. F. Otto and F. Mrâz, Non-returning finite automata with translucent letters. 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Electronic Proceedings in Theoretical Computer-Science, EPTCS, vol. 367 (2022) 143–159. [Google Scholar]
  30. H. Chigahara, S. Zsolt Fazekas and A. Yamamura, One-way jumping finite automata. Int. J. Found. Comput. Sci. 27 (2016) 391–405. [Google Scholar]
  31. A. Meduna and P. Zemek, Jumping finite automata. Int. J. Found. Comput. Sci. 23 (2012) 1555–1578. [CrossRef] [Google Scholar]
  32. B. Nagy, State-deterministic finite automata with translucent letters and finite automata with nondeterministically translucent letters. 16th International Conference on Automata and Formal Languages (AFL 2023), EPTCS, vol. 386 (2023) 170–184. [Google Scholar]
  33. R. Loukanova, Linear context free languages, in Theoretical Aspects of Computing - ICTAC 2007, 4th International Colloquium, Macau, China, September 26-28, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4711, edited by C.B. Jones, Z. Liu, J. Woodcock. Springer (2007) 351–365. [Google Scholar]
  34. B. Nagy, A class of 2-head finite automata for linear languages. Triangle, vol. 8 (Languages. Mathematical Approaches) (2012) 89–99. [Google Scholar]
  35. B. Nagy, On language classes accepted by stateless 5' → 3' Watson-Crick finite automata. Ann. Math. Inform. 58 (2023) 110–120. [Google Scholar]
  36. S. Dieck and S. Verwer, On bidirectional deterministic finite automata. CIAA 2024 : 28th International Conference on Implementation and Application of Automata, LNCS, vol. 15015 (2024) 109–123. [Google Scholar]
  37. S. Dieck and S. Verwer, An active learning algorithm for bidirectional deterministic finite automata. CIAA 2025: 29th International Conference on Implementation and Application of Automata, LNCS, vol. 15981 (2025) 99–114. [Google Scholar]
  38. B. Nagy, A Myhill-Nerode type characterization of 2detLIN languages. Proceedings 15th International Workshop on Non-Classical Models ofAutomata and Applications (NCMA 2025), EPTCS, vol. 422 (2025) 73–88. [Google Scholar]
  39. B. Nagy and W. Yasin, On some classes of reversible 2-head automata. Proceedings 15th International Workshop on Non-Classical Models ofAutomata and Applications (NCMA 2025), EPTCS, vol. 422 (2025) 89–103. [Google Scholar]
  40. R.J. Parikh, Language generating devices. MIT Res. Lab. Quart. Progr. Rep. 60 (1961) 199–212. [Google Scholar]
  41. R. Kocman, Z. Krivka, A. Meduna and B. Nagy, A jumping 5' → 3' Watson-Crick finite automata model. Acta Inform. 59 (2022) 557–584. [Google Scholar]
  42. B. Nagy and F. Otto, Two-head finite-state acceptors with translucent letters, in SOFSEM 2019: Theory and Practice ofComputer Science, LNCS, vol. 11376, edited by B. Catania, R. Kraâlovic, J. Nawrocki and G. Pighizzini. Springer (2019) 406–418. [Google Scholar]
  43. B. Nagy and F. Otto, Linear automata with translucent letters and linear context-free trace languages. RAIRO Theor. Inform. Appl. 54 (2020) 3. [Google Scholar]
  44. B. Nagy and Z. Kovâcs, On simple 5' → 3' sensing Watson-Crick finite-state transducers, in Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, edited by R. Freund, M. Holzer and J.M. Sempere. Österreichische Computer Gesellschaft (2019) 155–170. [Google Scholar]
  45. B. Nagy and Z. Kovacs, On deterministic 1-limited 5' → 3' sensing Watson-Crick finite-state transducers. RAIRO Theor. Inform. Appl. 55 (2021) 5 [Google Scholar]
  46. B. Nagy, A family of 2-head pushdown automata, in Proceddings of Seventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2015, Porto, Portugal, Österreichische Computer Gesellschaft (2015) 177–191. [Google Scholar]
  47. B. Nagy, 5' → 3' Watson-Crick pushdown automata. Inf. Sci. 537 (2020) 452–466. [Google Scholar]
  48. B. Nagy, 5' → 3' Watson-Crick automata accepting necklaces. 14th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2024, Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 407 (2024) 168–185. [Google Scholar]
  49. B. Nagy, Quasi-deterministic 5' → 3' Watson-Crick automata, In 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 367 (2022) 160–176. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.