I am studying "Theory of Computation" by Michael Sipser. I am studying the section where he teaches how to convert "RE to FA". He uses empty transitions for union, concat and star, but that is very getting very confusing for me
But i found this another method here: https://www.codingninjas.com/codestudio/library/conversion-of-regular-expressions-to-finite-automata
This method does not use empty transitions for union, concat and star.
I am more biased towards the second method, without the empty transitions for regular opoerations.
Do both of the methods yield the same result? that is accept the language described by the RE?