Homework1 Introduction to Theory of Computation Homework Total points: 100 You have to develop a Deterministic Finite Automata (DFA) that will recognize a certain Regular Language (RL). Following is a...

create dfa, make source code through java for the dfa


Homework1 Introduction to Theory of Computation Homework Total points: 100 You have to develop a Deterministic Finite Automata (DFA) that will recognize a certain Regular Language (RL). Following is a complete example of how to execute the problem. Sample Problem: Design a DFA that recognizes the RL A. A = {w|w is a string that accepts all the string with a substring 101} Paper prototype: Sample Input: Please enter a string, hit enter when you are done entering: 1010 Starts transition from the start state q0 Current state: q0 Input to read: 1 With input 1, transition happens from q0 to q1 Current state: q1 Input to read: 0 1 1 0 0 1 0 0 ,1 With input 0, transition happens from q1 to q2 Current state: q2 Input to read: 1 With input 1, transition happens from q2 to q3 Current state: q3 Input to read: 0 With input 0, transition happens from q3 to q3 Current state: q3 Input to read: None Reading the input 1010 has been completed at the state q3, which is an accept state Hence, 1010 is a string that belongs to language A. *Similarly, if a string entered by the user is not accepted, the program should demonstrate that in the same pattern. Guidelines: • Each person should submit the following materials o The source code ▪ Preferred language: Java, C++ o ReadMe file ▪ Paper prototype • The drawing of the machine (the way I have drawn on top of this document ▪ Manual to run the program • Typically include the classes and their functionality ▪ In pdf format • Only 1 submission from each person • Put all your files into one directory