Are there any specific mechanical ways to reduce a regular expression 'equation' to a more simple one?
Minimizing regular expressions is very hard, see for example a paper of Gramlich and Schnitger, who show that no $o(n)$ approximation algorithm exists unless P=PSPACE. Another type of answer to your question is the formal systems mentioned in my answer to your related question.