This paper aims at introducing nondeterministic finite automata with ε value which is used to perform some operations on languages. a program is created to implement the algorithm that converts nondeterministic finite automata with ε value (ε-NFA) to deterministic finite automata (DFA).The program is written in c++ programming language. The program inputs are FA 5-tuples from text file and then classifies it into either DFA\/NFA or ε -NFA. For DFA, the program will get the string *w<\/em> and decide whether it is accepted or rejected. The tracking path for an accepted string is saved by the program. In case of NFA or ε-NFA automation, the program changes the automation to DFA to enable tracking and to decide if the string w<\/em> exists in the regular language or not.<\/p>\r\n","references":"[1]\tJhone E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Introduction to automata theory, languages and computation. By Addison- Wesley 2nd Edition, 2001.\r\n[2]\tTarek Majid. Theory of Cmputation. Amman- Jordan 1st Edition2005.\r\n[3]\tS. P. Eugene Xavier. Theory of Automata, Formal Languages and Computation. By New Age International (P) Ltd, 2005.\r\n[4]\tK. l. P. Mishra, N. Chandrasekaran. Theory of Computer Science Automata, languages and Computation. third Edition, 2008.\r\n[5]\tJohn C. Martin. Introduction to languages, and the theory of computation. By McGraw-Hill 4th, 2011.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 147, 2019"}*