@article{(Open Science Index):https://publications.waset.org/pdf/10010172,
	  title     = {Using ε Value in Describe Regular Languages by Using Finite Automata, Operation on Languages and the Changing Algorithm Implementation},
	  author    = {Abdulmajid Mukhtar Afat},
	  country	= {},
	  institution	= {},
	  abstract     = {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 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 exists in the regular language or not.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {13},
	  number    = {3},
	  year      = {2019},
	  pages     = {153 - 157},
	  ee        = {https://publications.waset.org/pdf/10010172},
	  url   	= {https://publications.waset.org/vol/147},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 147, 2019},
	}