What are the steps/tricks/tips to construct a Büchi automaton from a given language? Let's say I have this language: $(a + bc)^∗((b + c)a^ω + (abb^∗)^ω)$

It seems pretty complicated, where should I begin with if I were to construct a Büchi automaton? 

I've been doing it the following way with smaller language sets: 


a $^*$ operator is usually a path coming from a node to the same node. 
a $+$ draws 2 branches 


how would $^ω$ be represented? there are other operators, which I have not seen yet, what are they and how would they also be represented? 

Pardon me if this is a silly question, but I'd rather ask than not knowing the answer ever. 

Any help is greatly appreciated. 
Thang
You can construct an NBA for an $\omega$-regular expression $r$ by induction on the generating sequence of $r$, using the constructive closure properties of NBAs.

You can see some examples here