Hi
I have been looking at all previously posted queries but didn't found any clue. I have a set of strings example {he,she} I have to make a DFA machine such that start state is 0
And for
word he
on input symbol h next state is 1
on input symbol i next state is 2
on input symbol i next state is 3
Similary for word she
on input symbol s next state is 4
on input symbol s next state is 5
on input symbol s next state is 6
I need a data structure to store this information so that I can use ot to simlaute a Determinisitc Finite Automota Machine
Initially I thought trees but I still am confused whether they are the right choice.Has any one got any ideas on it then Pleease help
Thanks in advance