EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 57 (2023) RAIRO-Theor. Inf. Appl., 57 (2023) 8 References
Issue
RAIRO-Theor. Inf. Appl.
Volume 57, 2023
12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022)
Article Number 8
Number of page(s) 35
DOI https://doi.org/10.1051/ita/2023009
Published online 18 October 2023
  1. S. Beier and M. Holzer, Properties of right one-way jumping finite automata. Theoret. Comput. Sci. 798 (2019) 78–94. [CrossRef] [MathSciNet] [Google Scholar]
  2. S. Beier and M. Holzer, Nondeterministic right one-way jumping finite automata. Inform. Comput. 284 (2022) 104687. [CrossRef] [Google Scholar]
  3. S. Bensch, H. Bordihn, M. Holzer and M. Kutrib, On input-revolving deterministic and nondeterministic finite automata. Inform. Comput. 207 (2009) 1140–1155. [CrossRef] [MathSciNet] [Google Scholar]
  4. G. Buntrock, F. Otto, Growing context-sensitive languages and Church–Rosser languages. Inform. Comput. 141 (1998) 1–36. [CrossRef] [MathSciNet] [Google Scholar]
  5. H. Chigahara, S.Z. Fazekas and A. Yamamura, One-way jumping finite automata. Int. J. Found. Comput. Sci. 27 (2016) 391–405. [CrossRef] [Google Scholar]
  6. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 4th edn. MIT Press (2022). [Google Scholar]
  7. V. Diekert and G. Rozenberg, The Book of Traces. World Scientific, Singapore (1995). [CrossRef] [Google Scholar]
  8. H. Fernau, M. Paramasivan and M.L. Schmid, Jumping finite automata: characterizations and complexity, edited by F. Drewes. CIAA 2012, Proc., Lecture Notes in Computer Science 9223. Springer, Heidelberg (2012) 89–101. [Google Scholar]
  9. P. Jančar, F. Mráz, M. Plátek and J. Vogel, Restarting automata, in edited by H. Reichel. FCT'95, Proc., Lecture Notes in Computer Science 965. Springer, Berlin (1995) 283–292. [Google Scholar]
  10. R. Loukanova, Linear context free languages, in edited by C.B. Jones, Z. Liu and J. Woodcock. ICTAC 2007, Proc., Lecture Notes in Computer Science 4711. Springer, Heidelberg (2007) 351–365. [Google Scholar]
  11. A. Meduna and P. Zemek, Jumping finite automata. Int. J. Found. Comput. Sci. 23 (2012) 1555–1578. [CrossRef] [Google Scholar]
  12. F. Mráz, Lookahead hierarchies of restarting automata. J. Automata Lang. Combinatorics 6 (2001) 493–506. [MathSciNet] [Google Scholar]
  13. F. Mráz and F. Otto, Non-returning finite automata with translucent letters, in edited by H. Bordihn, G. Horváth and G. Vaszil. 12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022). Vol. 367 of EPTCS. Open Publishing Association (2022) 143–159. [Google Scholar]
  14. F. Mráz and F. Otto, Recognizing picture languages by reductions to string languages. J. Automata Lang. Combinatorics 27 (2022) 199–228. [MathSciNet] [Google Scholar]
  15. B. Nagy, On 5′ → 3′ sensing Watson–Crick automata, in edited by M. Garzon and H. Yan. DNA Computing, 13th Intern. Meeting, Revised Selected Papers, Lecture Notes in Computer Science 4848. Springer, Heidelberg (2008) 256–262. [Google Scholar]
  16. B. Nagy and L. Kovács, Finite automata with translucent letters applied in natural and formal language theory, in edited by N.T. Nguyen, R. Kowalczyk, A. Fred and F. Joaquim. Transactions on Computational Collective Intelligence XVII, Lecture Notes in Computer Science 8790. Springer, Heidelberg (2014) 107–127. [CrossRef] [Google Scholar]
  17. B. Nagy and F. Otto, CD-systems of stateless deterministic R(1)-automata accept all rational trace languages, in edited by A.H. Dediu, H. Fernau and C. Martin-Vide. LATA 2010, Proc., Lecture Notes in Computer Science 6031. Springer, Berlin (2010) 463–474. [Google Scholar]
  18. B. Nagy and F. Otto, Finite-state acceptors with translucent letters, in edited by G. Bel-Enguix, V. Dahl and A.O. De La Puente. BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc. SciTePress, Portugal (2011) 3–13. [Google Scholar]
  19. B. Nagy and F. Otto, Globally deterministic CD-systems of stateless R(1)-automata, in edited by A.H. Dediu, S. Inenaga and C. Martín-Vide. Language and Automata Theory and Applications, LATA 2011, Proc., Lecture Notes in Computer Science 6638. Springer, Berlin (2011) 390–401. [Google Scholar]
  20. 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]
  21. B. Nagy and F. Otto, Globally deterministic CD-systems of stateless R-automata with window size 1. Int. J. Comput. Math. 90 (2013) 1254–1277. [Google Scholar]
  22. F. Otto, Restarting automata, in edited by Z. Ésik, C. Martín-Vide and V. Mitrana. Recent Advances in Formal Languages and Applications. Vol. 25 of Studies in Computational Intelligence. Springer, Heidelberg (2006) 269–303. [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.