References

  1. Simon Beier & Markus Holzer (2022): Nondeterministic right one-way jumping finite automata. Information and Computation 284, doi:10.1016/j.ic.2021.104687.
  2. Suna Bensch, Henning Bordihn, Markus Holzer & Martin Kutrib (2009): On input-revolving deterministic and nondeterministic finite automata. Information and Computation 207, pp. 1140–1155, doi:10.1016/j.ic.2009.03.002.
  3. Hiroyuki Chigahara, Szilárd Zsolt Fazekas & Akihiro Yamamura (2016): One-way jumping finite automata. International Journal of Foundations of Computer Science 27, pp. 391–405, doi:10.1142/S0129054116400165.
  4. Elias Dahlhaus & Manfred K. Warmuth (1986): Membership for growing context-sensitive grammars is poly\-nomial. Journal of Computer and System Sciences 33, pp. 456–472, doi:10.1016/0022-0000(86)90062-0.
  5. Henning Fernau, Meenakshi Paramasivan & Markus L. Schmid (2015): Jumping Finite Automata: Characterizations and Complexity. In: Frank Drewes: CIAA 2015, Proc., LNCS 9223. Springer, Berlin, pp. 89–101, doi:10.1007/978-3-319-22360-5_8.
  6. Petr Jančar, František Mráz, Martin Plátek & Jörg Vogel (1995): Restarting automata. In: Horst Reichel: FCT'95, Proc., LNCS 965. Springer, Berlin, pp. 283–292, doi:10.1007/3-540-60249-6_60.
  7. Alexander Meduna & Petr Zemek (2012): Jumping finite automata. International Journal of Foundations of Computer Science 23, pp. 1555–1578, doi:10.1142/S0129054112500244.
  8. František Mráz (2001): Lookahead hierarchies of restarting automata. Journal of Automata, Languages and Combinatorics 6, pp. 493–506, doi:10.25596/jalc-2001-493.
  9. František Mráz & Friedrich Otto (2022): Non-returning finite automata with translucent letters. In: Henning Bordihn, Géza Horváth & György Vaszil: 12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022), EPTCS 367. Open Publishing Association, Waterloo, Australia, pp. 143–159, doi:10.4204/EPTCS.367.10.
  10. František Mráz & Friedrich Otto (2023): Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO Theoretical Informatics and Applications 57, doi:10.1051/ita/2023009.
  11. Benedek Nagy & László Kovács (2014): Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory. In: Ngoc Thanh Nguyen, Ryszard Kowalczyk, Ana Fred & Filipe Joaquim: Transactions on Computational Collective Intelligence XVII, LNCS 8790. Springer, Heidelberg, pp. 107–127, doi:10.1007/978-3-662-44994-3_6.
  12. 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: LATA 2010, Proc., LNCS 6031. Springer, Berlin, pp. 463–474, doi:10.1007/978-3-642-13089-2_39.
  13. Benedek Nagy & Friedrich Otto (2011): Finite-state acceptors with translucent letters. In: Gemma Bel-Enguix, Veronica Dahl & Alfonso O. de la Puente: BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc.. SciTePress, Portugal, pp. 3–13, doi:10.5220/0003272500030013.
  14. Benedek Nagy & Friedrich Otto (2011): Globally deterministic CD-systems of stateless R(1)-automata. In: Adrian-Horia Dediu, Shunsuke Inenaga & Carlos Martín-Vide: LATA 2011, Proc., LNCS 6638. Springer, Berlin, pp. 390–401, doi:10.1007/978-3-642-21254-3_31.
  15. Benedek Nagy & Friedrich Otto (2012): On CD-systems of stateless deterministic R-automata with window size one. Journal of Computer and System Sciences 78, pp. 780–806, doi:10.1016/j.jcss2011.12.009.
  16. Benedek Nagy & Friedrich Otto (2013): Globally deterministic CD-systems of stateless R-automata with window size 1. International Journal of Computer Mathematics 90, pp. 1254–1277, doi:10.1080/00207160.2012.688820.
  17. Friedrich Otto (2006): Restarting automata. In: Zoltan Ésik, Carlos Martín-Vide & Victor Mitrana: Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25. Springer, Heidelberg, pp. 269–303, doi:10.1007/978-3-540-33461-3_11.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org