I am solving some example exercises in preparation of a Computational Theory examination.
In Exercise 2, I am tasked with building an NFA and DFA of the regular expression: $(b|bba)^*a$
My question is: Can I simplify $b|bba$ inside the parentheses to $bba$? Are they indeed equivalent or will I be breaking some generality?
I am asking this since it is going to be easier for me to construct the automata after the simplification.