Closure Properties of General Jumping Finite Automata

The current paper suggests a fresh disquisition space inside automata proposition – Jumping Finite Automata(JFA). This concept functions unlike traditional automata because it recites input expressions irregularly — i.e., afterward examining a character, they may go to certain characters inside string, moreover carry on its calculation from here. The research founds numerous outcomes regarding JFA in relations of generally delved regions of automata proposition, similar as closure possessions. Some of these possessions of GJFA mirror image and Kleene plus (K)+, and Kleene star (K)* which are not clear till now, are debated in this paper.