Pumping lemmata for fuzzy languages accepted by jumping and right one-way jumping fuzzy finite automata

Abstract

Jumping finite automata represent an interesting kind of automata working discontinuously over their input. They can read any input symbol and jump without restrictions on any other (not yet processed) symbol. Right one-way jumping finite automata start their reading from the first symbol of the input word, their 'jumps' can be performed only in the left-to-right direction and after reaching the end of the input word, they can resume from its left hand side. This modified specification (in deterministic and nondeterministic variants) leads to automata with different computational power. The paper deals with fuzzy versions of these automata and with pumping lemmata for fuzzy languages accepted by them.