ISSN 2394-5125
 

Research Article 


CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA

Harjot Singh, Rajeev Sharma, Pardeep Tiwana.

Abstract
Abstract
Classical computer models that process information in sequential manner likefinite automata are best known for capturing the
family of regular languages. However, modern computer models process information in a non-sequential manner. To overcome
this problem new investigation area in automata theory called jumping finite automata have been introduced. These automata
work similar to classical finite automata except that they process information in discontinuous way. This paper proposes the
conversion of Jumping Finite Automata with null moves to Deterministic Jumping Finite Automata withexample. The study has
been undertaken to check whether Jumping Finite Automata with and without null moves accept same language or not. Beside
all these some closure properties of General Jumping Finite Automata (kleene star (K)* and kleene plus (K)+ ) and mirror image
that are not yet defined are also discussed here. The comparison of classical finite automata and jumping finite automataon
different parameter has also been discussed.

Key words: Keywords: Classical finite automata, discontinuous tape reading,jumping finite automata, General jumping finite automata, JFA with null moves (Ɛ-JFA).


 
ARTICLE TOOLS
Abstract
PDF Fulltext
How to cite this articleHow to cite this article
Citation Tools
Related Records
 Articles by Harjot Singh
Articles by Rajeev Sharma
Articles by Pardeep Tiwana
on Google
on Google Scholar


How to Cite this Article
Pubmed Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. JCR. 2020; 7(17): 2526-2542. doi:10.31838/jcr.07.17.313


Web Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. http://www.jcreview.com/?mno=100435 [Access: August 18, 2021]. doi:10.31838/jcr.07.17.313


AMA (American Medical Association) Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. JCR. 2020; 7(17): 2526-2542. doi:10.31838/jcr.07.17.313



Vancouver/ICMJE Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. JCR. (2020), [cited August 18, 2021]; 7(17): 2526-2542. doi:10.31838/jcr.07.17.313



Harvard Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana (2020) CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. JCR, 7 (17), 2526-2542. doi:10.31838/jcr.07.17.313



Turabian Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. 2020. CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. Journal of Critical Reviews, 7 (17), 2526-2542. doi:10.31838/jcr.07.17.313



Chicago Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. "CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA." Journal of Critical Reviews 7 (2020), 2526-2542. doi:10.31838/jcr.07.17.313



MLA (The Modern Language Association) Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana. "CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA." Journal of Critical Reviews 7.17 (2020), 2526-2542. Print. doi:10.31838/jcr.07.17.313



APA (American Psychological Association) Style

Harjot Singh, Rajeev Sharma, Pardeep Tiwana (2020) CONVERSION OF JUMPING FINITE AUTOMATA WITH NULL MOVES TO DETERMINISTIC JUMPING FINITE AUTOMATA. Journal of Critical Reviews, 7 (17), 2526-2542. doi:10.31838/jcr.07.17.313