One-Way Jumping Finite Automata

We propose the one-way jumping finite automaton model, restricting the jumping relation of the recently introduced jumping finite automaton so that the machine can only jump over symbols it cannot process in its current state. The reading head of a one-way jumping finite automaton moves deterministically in one direction within the input word, whereas movement of the reading head of jumping finite automaton is non deterministic. The class of languages accepted by one-way jumping finite automata is different frorn that of jumping finite automata, in particular, it includes all regular languages, as opposed to the latter. We study one-way jumping finite automata and obtain closure properties, a pumping lemma, and separation results with respect to the classical language classes of the Chomsky hierarchy.