Addressing the Limitation of ‎JFLAP Mealy Machine for ‎Binary Increments

Mr. Amjad Khan and Mr. Muhammad Haleem

Volume 2 Issue 1 | Dec 2020

DOI: 10.31841/KJET.2021.13

Views: 594

Total Downloads: 7

Download PDF

Abstract

JFLAP stands for java formal language and ‎automata package which ‎was developed by Susan H. ‎Rodger and Thomas W. Finley at Duke ‎University ‎for graduate and undergraduate students to ‎simulate and test ‎different automatons using its ‎graphical interface. Using JFLAP students ‎can ‎develop the generation and recognition devices not ‎only for regular ‎languages but also for non-regular ‎languages. Moore and Mealy are two ‎‎machines which will produce output on any given ‎input. But in some cases ‎when a user develops ‎valid Mealy machine (MM) and enter the valid ‎input ‎string, JFLAP produces wrong output. In this ‎article, the discrepancy of ‎JFLAP in term of results ‎produced by Mealy machine (MM) is identified ‎and ‎solution has been proposed using java ‎language. It has been observed that ‎the ‎solution proposed in this article totally eliminates ‎the problem of ‎producing wrong results particularly ‎in case of developing an incremental ‎Mealy ‎machine (MM).‎

Keywords: Moore machine, Mealy machine, Finite ‎automata