Universal virtual NFA. Develop a program analogous to PROGRAM 5.1.3 that can simulate the...

Universal virtual NFA. Develop a program analogous to PROGRAM 5.1.3 that can simulate the operation of any NFA. Implement the method described in the text, using a graph representation for the NFA and a Queue to keep track of the set of possible states, as in EXERCISE 5.1.36. Instrument your program to print a trace of the set of possible states for the NFA before reading each symbol. Test your code by running it for the NFA described in the text that recognizes the set of all strings whose fourth-to-last symbol is a 1 on the input aaaaababaabbbaababbbb.

EXERCISE 5.1.36

Empty language test. Add a method isEmpty() to DFA (PROGRAM 5.1.3) that returns true if the language recognized by the machine is empty, and false otherwise.

Program 5.1.3 Universal virtual DFA