Jumping fuzzy general finite automata and their simplified description

The paper deals with a simplified form of jumping fuzzy general finite automata where transition function is bivalent and only the final states form a fuzzy set. It is proved that despite the simplification, the computational power of the automata is not reduced. © 2019 The authors and IOS Press. All rights reserved