Consider the regular expression (0+1)*1(0+1)(0+1) over the alphabet {0,1}. Can you describe the regular language that represents the RE?

A DFA that recognizes this regular expression is given below. Your task is to write a C++ program (no need of implementing object-oriented) to implement the given DFA. Your program should be able to read a long string contained in a text file. The program should use the DFA to find and print out every substring (with its location) of length between 3 and 5 which are recognized by the DFA. Note that the same substring may occur more than once in the string. Lets say it occurs twice. If it is accepted by the DFA, it should be printed twice. A test file is provided for you on BlackBoard.

Consider the regular expression (0+1)*1(0+1) (0+1) over the alphabet 10,1). Can you describe the regular language that represents the RE? A DFA that recognizes this regular expression is given below. Your task is to write a C++ program (no need of implementing object oriented) to implement the given DFA. Your program should be able to read a long string contained in a text file. The program should use the DFA to find and print out every substring (with its location) of length between 3 and 5 which are recognized by the DFA. Note that the same substring may occur more than once in the string. Let's say it occurs twice. If it is accepted by the DFA, it should be printed twice. A test file is provided for you on BlackBoard. 0 0 0 100 o10 110 0 0 1001 101 011 1