1) Using java, build a mini-simulator for Turing Machines. 2) The simulator requirements are the same for HW01 but considering the differences between DFA and TM. 3) The simulator needs to show intermediate transitions. 4) The simulator needs to show the state of the tape (probably as a char array updated every transition).

(Hw 1requirements)

Implement DFA as a menu-based or GUI program

2) Allow the user to configure the DFA interactively and using a config txt file

3) The configuration consists of: {Q, q0, F, S, d}

4) The DFA continuously allows the user to enter an input string via keyboard or a list of strings in a txt file

5) The DFA scans the input string and generates a ACCEPT or REJECT.