References

  1. Henning Bordihn, Markus Holzer & Martin Kutrib (2005): Revolving-Input Finite Automata. In: Clelia de Felice & Antonio Restivo: Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings, Lecture Notes in Computer Science 3572. Springer, pp. 168–179, doi:10.1007/11505877_15.
  2. P. Cartier & D. Foata (1969): Problèmes combinatoires de commutation et réarrangements. Springer, doi:10.1007/BFb0079468.
  3. Hiroyuki Chigahara, Szilárd Zsolt Fazekas & Akihiro Yamamura (2016): One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 27(3), pp. 391, doi:10.1142/S0129054116400165.
  4. Volker Diekert & Gregorz (eds.) Rozenberg (1995): The Book of Traces. World Scientific, Singapore, doi:10.1142/2563.
  5. Madeeha Fatima & Benedek Nagy (2020): Transduced-Input Automata with Translucent Letters. Comptes rendus de l'Académie bulgare des Sciences 73(1), pp. 33–39, doi:10.7546/CRABS.2020.01.04.
  6. Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg & Arto Salomaa (1997): Watson-Crick finite automata. In: Harvey Rubin & David Harlan Wood: DNA Based Computers, Proceedings of a DIMACS Workshop, Philadelphia, Pennsylvania, USA, June 23-25, 1997, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 48. DIMACS/AMS, pp. 297–327, doi:10.1090/dimacs/048/22.
  7. M. A. Harrison (1978): Introduction to Formal Language Theory. Addison-Wesley.
  8. J.E. Hopcroft & J.D. Ullman (1979): Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A..
  9. Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka & Jörg Vogel (1995): Restarting Automata, Marcus Grammars and Context-Free Languages. In: Jürgen Dassow, Grzegorz Rozenberg & Arto Salomaa: Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995. World Scientific, Singapore, pp. 102–111.
  10. Ryszard Janicki, Jetty Kleijn, Maciej Koutny & Lukasz Mikulski (2019): Classifying invariant structures of step traces. J. Comput. Syst. Sci. 104, pp. 297–322, doi:10.1016/j.jcss.2017.05.002.
  11. Radim Kocman, Zbynek Krivka, Alexander Meduna & Benedek Nagy (2022): A jumping 5'\ rightarrow 3'Watson-Crick finite automata model. Acta Informatica 59(5), pp. 557–584, doi:10.1007/s00236-021-00413-x.
  12. Roussanka Loukanova (2007): Linear Context Free Languages. In: Cliff B. Jones, Zhiming Liu & Jim Woodcock: Theoretical Aspects of Computing - ICTAC 2007, 4th International Colloquium, Macau, China, September 26-28, 2007, Proceedings, Lecture Notes in Computer Science 4711. Springer, pp. 351–365, doi:10.1007/978-3-540-75292-9_24.
  13. Alexandru Mateescu, Kai Salomaa & Sheng Yu (2000): On Fairness of Many-Dimensional Trajectories. J. Autom. Lang. Comb. 5(2), pp. 145–157, doi:10.25596/jalc-2000-145.
  14. Alexander Meduna & Petr Zemek (2012): Jumping Finite Automata. Int. J. Found. Comput. Sci. 23(7), pp. 1555–1578, doi:10.1142/S0129054112500244.
  15. Frantisek Mráz & Friedrich Otto (2022): Non-Returning Finite Automata With Translucent Letters. In: Henning Bordihn, Géza Horváth & György Vaszil: Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022, EPTCS 367, pp. 143–159, doi:10.4204/EPTCS.367.10.
  16. B. Nagy & F. Otto (2011): Finite-state acceptors with translucent letters. In: G. Bel-Enguix, V. Dahl & A.O. De La Puente: BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc.; in ICAART 2011: 3rd International Conference on Agents and Artificial Intelligence. SciTePress, Portugal, pp. 3–13.
  17. Benedek Nagy (2008): On 5' 3' Sensing Watson-Crick Finite Automata. In: Max H. Garzon & Hao Yan: DNA Computing, 13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers, Lecture Notes in Computer Science 4848. Springer, pp. 256–262, doi:10.1007/978-3-540-77962-9_27.
  18. Benedek Nagy (2009): Languages generated by context-free grammars extended by type AB → BA rules. Journal of Automata, Languages and Combinatorics 14, pp. 175–186.
  19. Benedek Nagy (2011): On CD-Systems of Stateless Deterministic R(2)-Automata. J. Autom. Lang. Comb. 16(2-4), pp. 195–213, doi:10.25596/jalc-2011-195.
  20. Benedek Nagy (2012): A class of 2-head finite automata for linear languages. Triangle 8 (Languages. Mathematical Approaches), pp. 89–99.
  21. Benedek Nagy (2013): On a hierarchy of 5'3' sensing Watson-Crick finite automata languages. J. Log. Comput. 23(4), pp. 855–872, doi:10.1093/logcom/exr049.
  22. Benedek Nagy (2021): State-deterministic 5'3' Watson-Crick automata. Nat. Comput. 20(4), pp. 725–737, doi:10.1007/s11047-021-09865-z.
  23. Benedek Nagy (2009): On a hierarchy of 5'3' sensing WK finite automata languages. In: Mathematical Theory and Computational Practice, CiE, Abstract Booklet, Heidelberg, Germany, pp. 266–275.
  24. Benedek Nagy (2022): Quasi-deterministic 5' 3' Watson-Crick Automata. In: Henning Bordihn, Géza Horváth & György Vaszil: Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022, EPTCS 367, pp. 160–176, doi:10.4204/EPTCS.367.11.
  25. Benedek Nagy & Arif A. Akkeles (2017): Trajectories and Traces on Non-traditional Regular Tessellations of the Plane. In: Valentin E. Brimkov & Reneta P. Barneva: Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Plovdiv, Bulgaria, June 19-21, 2017, Proceedings, Lecture Notes in Computer Science 10256. Springer, pp. 16–29, doi:10.1007/978-3-319-59108-7_2.
  26. Benedek Nagy & László Kovács (2014): Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory. In: Transactions on Computational Collective Intelligence XVII, Lecture Notes in Computer Science 8790. Springer, pp. 107–127, doi:10.1007/978-3-662-44994-3_6.
  27. Benedek Nagy & Friedrich Otto (2010): CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. In: Adrian-Horia Dediu, Henning Fernau & Carlos Martín-Vide: Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings, Lecture Notes in Computer Science 6031. Springer, pp. 463–474, doi:10.1007/978-3-642-13089-2_39.
  28. Benedek Nagy & Friedrich Otto (2011): An Automata-Theoretical Characterization of Context-Free Trace Languages. In: Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic & Stefan Wolf: SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, Lecture Notes in Computer Science 6543. Springer, pp. 406–417, doi:10.1007/978-3-642-18381-2_34.
  29. Benedek Nagy & Friedrich Otto (2011): Globally Deterministic CD-Systems of Stateless R(1)-Automata. In: Adrian-Horia Dediu, Shunsuke Inenaga & Carlos Martín-Vide: Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings, Lecture Notes in Computer Science 6638. Springer, pp. 390–401, doi:10.1007/978-3-642-21254-3_31.
  30. Benedek Nagy & Friedrich Otto (2012): On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78(3), pp. 780–806, doi:10.1016/j.jcss.2011.12.009.
  31. Benedek Nagy & Friedrich Otto (2013): Globally deterministic CD-systems of stateless R-automata with window size 1. Int. J. Comput. Math. 90(6), pp. 1254–1277, doi:10.1080/00207160.2012.688820.
  32. Benedek Nagy & Friedrich Otto (2020): Linear automata with translucent letters and linear context-free trace languages. RAIRO Theor. Informatics Appl. 54, pp. 3, doi:10.1051/ita/2020002.
  33. Benedek Nagy & Shaghayegh Parchami (2021): On deterministic sensing 5'3' Watson-Crick finite automata: a full hierarchy in 2detLIN. Acta Informatica 58(3), pp. 153–175, doi:10.1007/s00236-019-00362-6.
  34. Benedek Nagy & Shaghayegh Parchami (2022): 5'3' Watson-Crick automata languages – without sensing parameter. Nat. Comput. 21(4), pp. 679–691, doi:10.1007/s11047-021-09869-9.
  35. Benedek Nagy, Shaghayegh Parchami & Hamid Mir Mohammad Sadeghi (2017): A New Sensing 5'3' Watson-Crick Automata Concept. In: Erzsébet Csuhaj-Varjú, Pál Dömösi & György Vaszil: Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, September 4-6, 2017, EPTCS 252, pp. 195–204, doi:10.4204/EPTCS.252.19.
  36. Friedrich Otto (2006): Restarting Automata. In: Zoltán Ésik, Carlos Martín-Vide & Victor Mitrana: Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25. Springer, pp. 269–303, doi:10.1007/978-3-540-33461-3_11.
  37. Shaghayegh Parchami & Benedek Nagy (2018): Deterministic Sensing 5' 3' Watson-Crick Automata Without Sensing Parameter. In: Susan Stepney & Sergey Verlan: Unconventional Computation and Natural Computation - 17th International Conference, UCNC 2018, Fontainebleau, France, June 25-29, 2018, Proceedings, Lecture Notes in Computer Science 10867. Springer, pp. 173–187, doi:10.1007/978-3-319-92435-9_13.
  38. R. J. Parikh (1961): Language generating devices. MIT Res. Lab., Quarterly Progress Report 60, pp. 199–212.
  39. Gheorghe Paun, Grzegorz Rozenberg & Arto Salomaa (1998): DNA Computing - New Computing Paradigms. Texts in Theoretical Computer Science. An EATCS Series. Springer, doi:10.1007/978-3-662-03563-4.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org