Theory of computation

1. [50 points] Below is the transition table for a DFA that recognizes a particular regular language. Write a C++ or Java program that checks if an input string is accepted or rejected by the DFA F 2 3 2 F 31 4 s15 5 Several example I/O are given below (bolded are user input). E means empty string. Note that these are example input strings. Your program should be written to work for any input string containing a's and b's Enter a string: E E is a valid string Enter a string: bb bb is a valid string Enter a string: bbabb bbabb is a valid string Enter a string: bbaaaaaaaaaaa bbaaaa is a valid string Enter a string: aaaa aaaa is a valid string Enter a string: bab bab is valid string Enter a string: a a is a valid string Enter a string: ab a is not a valid string Enter a string: abbb a is not a valid string Enter a string: babaaaa a is not a valid string