Beier, SimonSimonBeierHolzer, MarkusMarkusHolzer2022-09-122018-04-242022-09-122018http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-135162https://jlupub.ub.uni-giessen.de/handle/jlupub/7551http://dx.doi.org/10.22029/jlupub-6985Right one-way jumping finite automata (ROWJFAs), were recently introduced in [H. Chigahara, S.Z. Fazekas, A. Yamamura: One-Way Jumping Finite Automata, Internat. J. Found. Comput. Sci., 27(3), 2016] and are jumping automata that process the input in a discontinuous way with the restriction that the input head reads deterministically from left-to-right starting from the leftmost letter in the input and when it reaches the end of the input word, it returns to the beginning and continues the computation. We solve most of the open problems of these devices. In particular, we characterize the family of permutation closed languages accepted by ROWJFAs in terms of Myhill-Nerode equivalence classes. Using this, we investigate closure and non-closure properties as well as inclusion relations to other language families. We also give more characterizations of languages accepted by ROWJFAs for some interesting cases.enIn Copyrightjumping finite automataone-way restrictioncharacterizationsinclusion relationsclosure propertiesddc:004