I am trying to create a Finite State Machine that is able to check if a number string is valid. For example, it would accept 3, 4.65 or 8.93e-10. So far I have created a transition table for the machine as follows:
I am having trouble understanding on how to create the state table that I can then use to create the Karnaugh-map for this machine. I understand that I would have to convert the state and transition values into their binary equivalent and then list the inputs and outputs for each state.
I would appreciate if someone could guide me in the process of creating a state table that can then be used to create a Karnaugh-map.