*PLEASE ONLY ANSWER WITH COMPLETE, WORKING CODE THAT ANSWERS MY QUESTION*

*I AM RUNNING OUT OF QUESTIONS - PLEASE DON'T WASTE THEM WITH HALF-ANSWERS*

Please, include a main with test cases.

I have also included the code volunteered in a previous answer.

Thank you!

public class State{ private Map transitions=new HashMap(); public void addTransition(char ch,State st){ transitions.put(ch,st); } public State next(char ch){ return transitions.get(ch); } private boolean fin=false; public boolean isFinal(){return fin;} public boolean setFinal(boolean f){fin=f;} } 

and then the loop will be

State currState=startState; while(currState!=null && input.hasNextChar()){//you can also end directly when final state is reached char next = input.nextChar();//get next character currState = currState.next(next); } if(currState!=null && currState.isFinal()){ // reached final state }else{ // to bad didn't match } 

Using Java, please write a simple program to convert an NFA to a DFA would be: from a given array of transitions. An example of an input 0 91 92 92 42 So you would input an NFA matrix and output a DFA matrix. Please *Do not* give me regular expression to nfa to Dfa. It's far too complex for the given prompt. The simpler the better. Thanks! Show transcrihed image teyt