3 research outputs found
Automata with One-way Jumping Mode (Algebraic system, Logic, Language and Related Areas in Computer Sciences II)
Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts
Sweep Complexity Revisited
We study the sweep complexity of DFA in one-way jumping mode answering
several questions posed earlier. This measure is the number of times in the
worst case that such machines have to return to the beginning of their input
after having skipped some of the symbols. The class of languages accepted by
these machines strictly includes the regular class and constant sweep
complexity allows exactly the acceptance of regular languages. However, we show
that there exist machines with higher than constant complexity still only
accepting regular languages and that in general the sweep complexity of an
automaton does not distinguish between accepting regular and non-regular
languages. We establish separation results for asymptotic classes defined by
this complexity measure and give a surprising exponential/logarithmic relation
between factors of certain inputs which can be verified by such machines.Comment: 12 pages, 8 figure