How to transform a non-deterministic finite automaton (with or without empty moves) in a deterministic finite automaton?
Please, you have an example
Which of these are you wanting to be empty, if any?
This should be in your lecture notes:
Let be a non-deterministic automaton with epsilon-travels ("empty movements")
Then the equivalent non-deterministic automaton without epsilon travels is where:
(this means that any state that was reachable from with epsilon-travels and input , is now reachable from only with input )
if , then