I have a program that simply takes all the states as a set of states as a input.
And then the next input that is taken is the initial state among the set of states and then set of final states.

The next is a set of transition that I take among the states.

For example: `q0,1,q1`

This means on input one there is a transition from q0 to q1.

For each state the transitions are entered.

But here what I am facing is the refrences can be jumpled up in a random fashion
that is the transitions can be n number of transition for non duplicate characters, and hence cause of this I want to maintain a hashmap object for each state dynamically.

How can I achieve this?